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!)
A132919 Triangle read by rows: T(n,k) = Fibonacci(n) + k - 1. 2

%I #8 Mar 06 2022 00:11:32

%S 1,1,2,2,3,4,3,4,5,6,5,6,7,8,9,8,9,10,11,12,13,13,14,15,16,17,18,19,

%T 21,22,23,24,25,26,27,28,34,35,36,37,38,39,40,41,42,55,56,57,58,59,60,

%U 61,62,63,64,89,90,91,92,93,94,95,96,97,98,99

%N Triangle read by rows: T(n,k) = Fibonacci(n) + k - 1.

%C Left border = Fibonacci numbers, right border = A081659.

%C Infinite lower triangular matrix by rows: n-th row = n terms of: F(n) followed by (F(n) + 1), (F(n) + 2), (F(n) + 3), ...

%H Andrew Howroyd, <a href="/A132919/b132919.txt">Table of n, a(n) for n = 1..1275</a> (rows 1..50)

%e First few rows of the triangle:

%e 1;

%e 1, 2;

%e 2, 3, 4;

%e 3, 4, 5, 6;

%e 5, 6, 7, 8, 9;

%e 8, 9, 10, 11, 12, 13;

%e ...

%o (PARI) T(n,k) = if(k<=n, fibonacci(n) + k - 1, 0); \\ _Andrew Howroyd_, Aug 10 2018

%Y Row sums are A132920.

%Y Cf. A127647, A127648, A081659, A000045.

%K nonn,tabl

%O 1,3

%A _Gary W. Adamson_, Sep 05 2007

%E Name changed and terms a(56) and beyond from _Andrew Howroyd_, Aug 10 2018

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 17 04:55 EDT 2024. Contains 374360 sequences. (Running on oeis4.)