login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A108617 Triangle read by rows: T(n,k) = T(n-1,k-1)+T(n-1,k) for 0<k<n, T(n,0) = T(n,n) = n-th Fibonacci number. 2
0, 1, 1, 1, 2, 1, 2, 3, 3, 2, 3, 5, 6, 5, 3, 5, 8, 11, 11, 8, 5, 8, 13, 19, 22, 19, 13, 8, 13, 21, 32, 41, 41, 32, 21, 13, 21, 34, 53, 73, 82, 73, 53, 34, 21, 34, 55, 87, 126, 155, 155, 126, 87, 55, 34, 55, 89, 142, 213, 281, 310, 281, 213, 142, 89, 55, 89, 144, 231, 355, 494 (list; table; graph; refs; listen; history; internal format)
OFFSET

0,5

COMMENTS

T(n,0) = T(n,n) = A000045(n);

T(n,1) = T(n,n-1) = A000045(n+1) for n>0;

T(n,2) = T(n,n-2) = A000045(n+2)-2 = A001911(n-1) for n>1;

sum of n-th row = 2*A027934(n-1) for n>0.

CROSSREFS

Cf. A108037, A007318.

Sequence in context: A033775 A033791 A039913 * A092683 A172089 A057475

Adjacent sequences:  A108614 A108615 A108616 * A108618 A108619 A108620

KEYWORD

nonn,tabl

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jun 12 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 21:56 EST 2012. Contains 205860 sequences.