|
Search: id:A104762
|
|
|
| A104762 |
|
Triangle read by rows: row n contains first n nonzero Fibonacci numbers in decreasing order. |
|
+0
7
|
|
| 1, 1, 1, 2, 1, 1, 3, 2, 1, 1, 5, 3, 2, 1, 1, 8, 5, 3, 2, 1, 1, 13, 8, 5, 3, 2, 1, 1, 21, 13, 8, 5, 3, 2, 1, 1, 34, 21, 13, 8, 5, 3, 2, 1, 1, 55, 34, 21, 13, 8, 5, 3, 2, 1, 1, 89, 55, 34, 21, 13, 8, 5, 3, 2, 1, 1, 144, 89, 55, 34, 21, 13, 8, 5, 3, 2, 1, 1, 233, 144, 89, 55, 34, 21, 13, 8, 5, 3, 2, 1
(list; table; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
COMMENT
|
Sum of n-th row = F(n+2) - 1; sequence A000071 starting (1, 2, 4, 7, 12, 20,...).
Riordan array (1/(1-x-x^2),x) . [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Apr 23 2009]
|
|
FORMULA
|
In every column, (1, 1, 2, 3, 5,...); the nonzero Fibonacci numbers, A000045.
a(n,k) = A000045(n-k+1). - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jun 23 2006
|
|
EXAMPLE
|
First few rows of the triangle are:
1;
1, 1;
2, 1, 1;
3, 2, 1, 1;
5, 3, 2, 1, 1;
8, 5, 3, 2, 1, 1;
...
|
|
CROSSREFS
|
Cf. A000045, A000071.
Companion triangle A104763, Fibonacci sequence in each row starting from the left.
Sequence in context: A114282 A112739 A027293 this_sequence A152462 A098805 A049286
Adjacent sequences: A104759 A104760 A104761 this_sequence A104763 A104764 A104765
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Gary W. Adamson (qntmpkt(AT)yahoo.com), Mar 23 2005, Mar 05 2007
|
|
EXTENSIONS
|
Edited by N. J. A. Sloane (njas(AT)research.att.com) at the suggestion of Philippe DELEHAM, Jun 11 2007
More terms from Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Apr 21 2009
|
|
|
Search completed in 0.002 seconds
|
