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!)
A193588 A Fibonacci triangle: T(n,k) = Fib(k+2) for 0 <= k <= n. 2
1, 1, 2, 1, 2, 3, 1, 2, 3, 5, 1, 2, 3, 5, 8, 1, 2, 3, 5, 8, 13, 1, 2, 3, 5, 8, 13, 21, 1, 2, 3, 5, 8, 13, 21, 34, 1, 2, 3, 5, 8, 13, 21, 34, 55, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233 (list; table; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
n-th row sum: A001911, Fib(n+3)-2;
n-th alternating row sum: A000045, F(n).
The augmentation (as defined at A193091) of A193588 is A193589.
LINKS
FORMULA
a(n) = A115346(n) + 1. - Filip Zaludek, Nov 19 2016
EXAMPLE
First 5 rows of A193588:
1;
1, 2;
1, 2, 3;
1, 2, 3, 5;
1, 2, 3, 5, 8;
MATHEMATICA
(See A193589, the augmentation of A193588.)
Table[Fibonacci[k+2], {n, 0, 20}, {k, 0, n}]//Flatten (* Harvey P. Dale, Nov 29 2017 *)
Module[{nn=15, fibs}, fibs=Fibonacci[Range[2, nn]]; Table[Take[fibs, n], {n, nn-1}]]// Flatten (* Harvey P. Dale, Mar 02 2023 *)
CROSSREFS
Cf. A193588.
Sequence in context: A060040 A092080 A264482 * A165884 A263939 A347499
KEYWORD
nonn,tabl
AUTHOR
Clark Kimberling, Jul 31 2011
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 July 13 21:44 EDT 2024. Contains 374288 sequences. (Running on oeis4.)