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

%I #24 Jan 17 2024 09:19:48

%S 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,

%T 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,

%U 10,11,13,17,24,36,56,89,12,11,11,11,12,14,18,25,37,57

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

%C Row sums give A081662.

%C Right border is A000045.

%C Old name was: Triangle by columns, F(n) followed by (F(n)+1), (F(n)+2), (F(n)+3), ...

%H David A. Corneth, <a href="/A132923/b132923.txt">Table of n, a(n) for n = 1..10011</a>

%F T(k, k) = Fibonacci(k). T(k + n, k) = T(k, k) + n. - _David A. Corneth_, Feb 14 2023

%e First few rows of the triangle:

%e 1;

%e 2, 1;

%e 3, 2, 2;

%e 4, 3, 3, 3;

%e 5, 4, 4, 4, 5;

%e 6, 5, 5, 5, 6, 8;

%e 7, 6, 6, 6, 7, 9, 13;

%e ...

%o (PARI) T(n, k) = fibonacci(k) + n - k \\ _David A. Corneth_, Feb 14 2023

%Y Cf. A000045, A081662.

%K nonn,tabl

%O 1,2

%A _Gary W. Adamson_, Sep 05 2007

%E More terms from and new name by _David A. Corneth_, Feb 14 2023