|
| |
|
|
A090162
|
|
Values of binomial(Fibonacci(2k)Fibonacci(2k+1),Fibonacci(2k-1)Fibonacci(2k)-1).
|
|
5
| | |
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| These numbers are known to occur at least six times in Pascal's triangle.
The next term is approximately 3.537 * 10^204 and is too large to include.
Equals binomial(A089508(n), A081016(n-1)) which is also binomial(A089508(n)+1, A081016(n-1)-1).
The numbers of digits in a(n), n>=1, are given in A100022.
|
|
|
REFERENCES
| A. I. Shirshov: On the equation binomial(n,m)=binomial(n+1,m-1), pp. 83-86, in: Kvant Selecta: Algebra and Analysis, I, ed. S. Tabachnikov, Am. Math. Soc., 1999
|
|
|
LINKS
| Eric Weisstein's World of Mathematics, Pascal's Triangle
|
|
|
MATHEMATICA
| Table[Binomial[Fibonacci[2k]Fibonacci[2k+1], Fibonacci[2k-1] Fibonacci[2k]-1], {k, 4}] (* From Harvey P. Dale, Aug 18 2011 *)
|
|
|
CROSSREFS
| Cf. A081016, A089508, A003015, A062527.
Sequence in context: A100896 A140915 A140928 * A031818 A152207 A004228
Adjacent sequences: A090159 A090160 A090161 * A090163 A090164 A090165
|
|
|
KEYWORD
| nonn,nice,bref
|
|
|
AUTHOR
| Eric Weisstein (eric(AT)weisstein.com), Nov 23, 2003 and Wolfdieter Lang (wolfdieter.lang_AT_physik_DOT_uni-karlsruhe_DOT_de), Dec 01 2003
|
| |
|
|
