|
Search: id:A045995
|
|
|
| A045995 |
|
Rows of Fibonacci-Pascal triangle. |
|
+0
3
|
|
| 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 3, 8, 3, 1, 1, 5, 55, 55, 5, 1, 1, 8, 610, 6765, 610, 8, 1, 1, 13, 10946, 9227465, 9227465, 10946, 13, 1, 1, 21, 317811, 225851433717, 190392490709135, 225851433717, 317811, 21, 1, 1, 34, 14930352
(list; table; graph; listen)
|
|
|
OFFSET
|
0,8
|
|
|
REFERENCES
|
R. Whitney, Problem H-254, Fib. Quart., 13 (1975), p. 281.
|
|
FORMULA
|
Take Pascal triangle (A007318) and replace each i by Fibonacci(i): a(n, k)=Fib(C(n, k)).
|
|
EXAMPLE
|
1; 1 1; 1 1 1; 1 2 2 1; 1 3 8 3 1; ...
|
|
CROSSREFS
|
Sequence in context: A007799 A122888 A092113 this_sequence A157654 A078692 A033151
Adjacent sequences: A045992 A045993 A045994 this_sequence A045996 A045997 A045998
|
|
KEYWORD
|
nonn,easy,nice,tabl
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
More terms from David W. Wilson (davidwwilson(AT)comcast.net).
|
|
|
Search completed in 0.002 seconds
|
