login
A045995
Rows of Fibonacci-Pascal triangle.
5
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
OFFSET
0,8
LINKS
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)=Fibonacci(binomial(n,k)).
EXAMPLE
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,
...
MAPLE
A045995 := proc(n, k)
combinat[fibonacci](binomial(n, k)) ;
end proc: # R. J. Mathar, Dec 03 2014
MATHEMATICA
Flatten[Table[Fibonacci[Binomial[n, k]], {n, 0, 10}, {k, 0, n}]] (* Harvey P. Dale, Dec 31 2013 *)
PROG
(Haskell)
a045995 n k = a045995_tabl !! n !! k
a045995_row n = a045995_tabl !! n
a045995_tabl = map (map (a000045 . fromInteger)) a007318_tabl
-- Reinhard Zumkeller, Dec 29 2011
CROSSREFS
Cf. A000045, A007318, A006449 (row sums), A081667.
Main diagonal gives A281450.
Sequence in context: A379432 A331485 A342061 * A360625 A157654 A357437
KEYWORD
nonn,easy,nice,tabl
EXTENSIONS
More terms from David W. Wilson
STATUS
approved