Products of factorials in binary recurrence sequences
The author shows that every non-degenerate binary recurrence sequence contains only finitely many terms which can be written as product of factorials. Further these terms can be effectively computed. In particular for the Lucas sequence \((L_n)_{n\geq 0}\), \(L_0=2\), \(L_1=1\) and \(L_{n+2}= L_{n+1}+ L_n\), the only terms which are products of factorials are \(L_0= 2!\) and \(L_3= (2!)^2\). The corresponding result for the Fibonacci sequence \((F_n)_{n\geq 0}\), \(F_0=0\), \(F_1=1\) and \(F_{n+2}= F_{n+1}+ F_n\), is \(F_3= 2!\), \(F_6= (2!)^3\) and \(F_{12}= (2!)^2 (3!)^2= 3!4!\). The proofs use estimations of linear forms in logarithms of algebraic numbers.
- Sums of factorials in binary recurrence sequences
- Linear combinations of factorials and S-units in a binary recurrence sequence
- On members of Lucas sequences which are either products of factorials or product of middle binomial coefficients and Catalan numbers
- On members of Lucas sequences which are products of factorials
- Sums of factorials in binary recurrence sequences
- On members of Lucas sequences which are products of factorials
- Linear combinations of factorials and S-units in a binary recurrence sequence
- scientific article; zbMATH DE number 1236731 (Why is no real title available?)
- scientific article; zbMATH DE number 7164333 (Why is no real title available?)
- Factorial-like values in the balancing sequence
- Expansions of binary recurrences in the additive base formed by the number of divisors of the factorial
- On factorials which are products of factorials
- Arithmetic properties of the sequence of derangements
- Cullen numbers and Woodall numbers in generalized Fibonacci sequences
- Sums or products of double factorials in Lucas sequences
This page was built for publication: Products of factorials in binary recurrence sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1567151)
