|
Search: id:A010048
|
|
|
| A010048 |
|
Triangle of Fibonomial coefficients. |
|
+0
20
|
|
| 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 3, 6, 3, 1, 1, 5, 15, 15, 5, 1, 1, 8, 40, 60, 40, 8, 1, 1, 13, 104, 260, 260, 104, 13, 1, 1, 21, 273, 1092, 1820, 1092, 273, 21, 1, 1, 34, 714, 4641, 12376, 12376, 4641, 714, 34, 1, 1, 55, 1870, 19635, 85085, 136136, 85085, 19635, 1870, 55, 1
(list; table; graph; listen)
|
|
|
OFFSET
|
0,8
|
|
|
COMMENT
|
Conjecture: polynomials with (positive) Fibonomial coefficients are reducible iff n odd >1. - Ralf Stephan, Oct 29 2004
|
|
REFERENCES
|
Paul Barry, On Integer-Sequence-Based Constructions of Generalized Pascal Triangles, Journal of Integer Sequences, Vol. 9 (2006), Article 06.2.4.
A. T. Benjamin and J. J. Quinn, Proofs that really count: the art of combinatorial proof, M.A.A. 2003, p. 15.
A. Brousseau, Fibonacci and Related Number Theoretic Tables. Fibonacci Association, San Jose, CA, 1972.
D. E. Knuth, The Art of Computer Programming. Addison-Wesley, Reading, MA, Vol. 1, p. 84 and 492.
|
|
LINKS
|
T. D. Noe, Rows n=0..50 of triangle, flattened
E. Krot, Further developments in Fibonomial calculus
E. Krot, An introduction to finite Fibonomial calculus
T. M. Richardson, The Filbert Matrix, arXiv:math/9905079
R. Stephan, A recurrence for the fibonomials
Eric Weisstein's World of Mathematics, Fibonacci Coefficient
|
|
FORMULA
|
a(n, k) = ((n, k)) = F(n)*F(n-1)*...*F(n-k+1)/F(k)*F(k-1)*...*F(1), F(i) = Fibonacci numbers A000045.
|
|
EXAMPLE
|
1; 1,1; 1,1,1; 1,2,2,1; 1,3,6,3,1; ...
|
|
CROSSREFS
|
Cf. A055870 (signed version of triangle). Row sums give A056569.
Columns include A000045, A001654, A001655, A001656, A001657, A001658, A056565, A056566, A056567.
Adjacent sequences: A010045 A010046 A010047 this_sequence A010049 A010050 A010051
Sequence in context: A008302 A131791 A010358 this_sequence A055870 A136512 A088459
|
|
KEYWORD
|
nonn,tabl,easy,nice
|
|
AUTHOR
|
njas
|
|
|
Search completed in 0.002 seconds
|
