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!)
A132923 Triangle read by rows: T(n, k) = Fibonacci(k) + n - k. 1
1, 2, 1, 3, 2, 2, 4, 3, 3, 3, 5, 4, 4, 4, 5, 6, 5, 5, 5, 6, 8, 7, 6, 6, 6, 7, 9, 13, 8, 7, 7, 7, 8, 10, 14, 21, 9, 8, 8, 8, 9, 11, 15, 22, 34, 10, 9, 9, 9, 10, 12, 16, 23, 35, 55, 11, 10, 10, 10, 11, 13, 17, 24, 36, 56, 89, 12, 11, 11, 11, 12, 14, 18, 25, 37, 57 (list; table; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Row sums give A081662.
Right border is A000045.
Old name was: Triangle by columns, F(n) followed by (F(n)+1), (F(n)+2), (F(n)+3), ...
LINKS
FORMULA
T(k, k) = Fibonacci(k). T(k + n, k) = T(k, k) + n. - David A. Corneth, Feb 14 2023
EXAMPLE
First few rows of the triangle:
1;
2, 1;
3, 2, 2;
4, 3, 3, 3;
5, 4, 4, 4, 5;
6, 5, 5, 5, 6, 8;
7, 6, 6, 6, 7, 9, 13;
...
PROG
(PARI) T(n, k) = fibonacci(k) + n - k \\ David A. Corneth, Feb 14 2023
CROSSREFS
Sequence in context: A317207 A102364 A342774 * A144329 A141157 A357213
KEYWORD
nonn,tabl
AUTHOR
Gary W. Adamson, Sep 05 2007
EXTENSIONS
More terms from and new name by David A. Corneth, Feb 14 2023
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 April 19 18:05 EDT 2024. Contains 371798 sequences. (Running on oeis4.)