login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A199512 Triangle T(n,k) = Fibonacci(n+k+1), related to A000045 (Fibonacci numbers). 2
1, 1, 2, 2, 3, 5, 3, 5, 8, 13, 5, 8, 13, 21, 34, 8, 13, 21, 34, 55, 89, 13, 21, 34, 55, 89, 144, 233, 21, 34, 55, 89, 144, 233, 377, 610, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181 (list; table; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
László Németh, On the Binomial Interpolated Triangles, Journal of Integer Sequences, Vol. 20 (2017), Article 17.7.8. See p. 15.
FORMULA
T(n,k) = T(n,k-1) + T(n-1,k-1) = T(n-1,k-1) + T(n-1,k).
T(n,0) = Fibonacci(n+1) = A000045(n+1).
EXAMPLE
Triangle begins :
1
1, 2
2, 3, 5
3, 5, 8, 13
5, 8, 13, 21, 34
8, 13, 21, 34, 55, 89
PROG
(PARI) T(n, k) = fibonacci(n+k+1);
tabl(nn) = for (n=0, nn, for (k=0, n, print1(T(n, k), ", ")); print); \\ Michel Marcus, Aug 01 2017
CROSSREFS
Rows sums : A096140, Diagonal sums : A128620.
Sequence in context: A067330 A202874 A355197 * A303969 A304931 A304669
KEYWORD
easy,nonn,tabl
AUTHOR
Philippe Deléham, Nov 07 2011
EXTENSIONS
More terms from Michel Marcus, Aug 01 2017
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 29 16:14 EDT 2024. Contains 373851 sequences. (Running on oeis4.)