|
Search: id:A054123
|
|
|
| A054123 |
|
Right Fibonacci row-sum array T(n,k), n >= 0, 0<=k<=n. |
|
+0
6
|
|
| 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 3, 2, 1, 1, 1, 4, 4, 2, 1, 1, 1, 5, 7, 4, 2, 1, 1, 1, 6, 11, 8, 4, 2, 1, 1, 1, 7, 16, 15, 8, 4, 2, 1, 1, 1, 8, 22, 26, 16, 8, 4, 2, 1, 1, 1, 9, 29, 42, 31, 16, 8, 4, 2, 1, 1, 1, 10, 37, 64, 57, 32, 16, 8, 4, 2, 1, 1, 1, 11, 46, 93, 99, 63, 32, 16, 8, 4, 2, 1, 1, 1, 12, 56
(list; table; graph; listen)
|
|
|
OFFSET
|
0,8
|
|
|
LINKS
|
Index entries for triangles and arrays related to Pascal's triangle
|
|
FORMULA
|
T(n, 0)=T(n, n)=1 for n >= 0; T(n, k)=T(n-1, k)+T(n-2, k-1) for k=1, 2, ..., n-1, n >= 2.
T(n, k)=T(n-1, k-1)+U(n-1, k) for k=1, 2, ..., [n/2], n >= 3, array U as in A011973.
|
|
EXAMPLE
|
Rows: {1}, {1,1}, {1,1,1}, {1,2,1,1}, {1,3,2,2,1}, ...
|
|
CROSSREFS
|
Reflection of array in A054124 about vertical central line.
Row sums: 1, 2, 3, 5, 8, 13, ... (Fibonacci numbers, A000045). Central numbers: 1, 1, 2, 4, 8, ... (binary powers, A000079). Cf. A011973.
Sequence in context: A108299 A065941 A123320 this_sequence A119269 A129713 A096669
Adjacent sequences: A054120 A054121 A054122 this_sequence A054124 A054125 A054126
|
|
KEYWORD
|
nonn,tabl,eigen,easy,nice
|
|
AUTHOR
|
Clark Kimberling (ck6(AT)evansville.edu)
|
|
EXTENSIONS
|
More terms from Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Apr 05 2003
|
|
|
Search completed in 0.002 seconds
|
