Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A045995
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A045995
%S A045995 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,
%T A045995 10946,9227465,9227465,10946,13,1,1,21,317811,225851433717,
%U A045995 190392490709135,225851433717,317811,21,1,1,34,14930352
%N A045995 Rows of Fibonacci-Pascal triangle.
%D A045995 R. Whitney, Problem H-254, Fib. Quart., 13 (1975), p. 281.
%F A045995 Take Pascal triangle (A007318) and replace each i by Fibonacci(i): a(n, 
               k)=Fib(C(n, k)).
%e A045995 1; 1 1; 1 1 1; 1 2 2 1; 1 3 8 3 1; ...
%Y A045995 Sequence in context: A007799 A122888 A092113 this_sequence A157654 A078692 
               A033151
%Y A045995 Adjacent sequences: A045992 A045993 A045994 this_sequence A045996 A045997 
               A045998
%K A045995 nonn,easy,nice,tabl
%O A045995 0,8
%A A045995 N. J. A. Sloane (njas(AT)research.att.com).
%E A045995 More terms from David W. Wilson (davidwwilson(AT)comcast.net).

    
page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 5 20:25 EST 2009. Contains 170428 sequences.


AT&T Labs Research