cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

This page as a plain text file.
%I A132919 #13 Mar 09 2025 13:49:23
%S A132919 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 A132919 21,22,23,24,25,26,27,28,34,35,36,37,38,39,40,41,42,55,56,57,58,59,60,
%U A132919 61,62,63,64,89,90,91,92,93,94,95,96,97,98,99
%N A132919 Triangle read by rows: T(n,k) = Fibonacci(n) + k - 1.
%C A132919 Left border = Fibonacci numbers, right border = A081659.
%C A132919 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 A132919 Andrew Howroyd, <a href="/A132919/b132919.txt">Table of n, a(n) for n = 1..1275</a> (rows 1..50)
%e A132919 First few rows of the triangle:
%e A132919   1;
%e A132919   1,  2;
%e A132919   2,  3,  4;
%e A132919   3,  4,  5,  6;
%e A132919   5,  6,  7,  8,  9;
%e A132919   8,  9, 10, 11, 12, 13;
%e A132919   ...
%t A132919 T[n_,k_]:=Fibonacci[n]+k-1;Table[T[n,k],{n,11},{k,n}]//Flatten (* _James C. McMahon_, Mar 09 2025 *)
%o A132919 (PARI) T(n,k) = if(k<=n, fibonacci(n) + k - 1, 0); \\ _Andrew Howroyd_, Aug 10 2018
%Y A132919 Row sums are A132920.
%Y A132919 Cf. A127647, A127648, A081659, A000045.
%Y A132919 Cf. A132921, A132923.
%K A132919 nonn,tabl
%O A132919 1,3
%A A132919 _Gary W. Adamson_, Sep 05 2007
%E A132919 Name changed and terms a(56) and beyond from _Andrew Howroyd_, Aug 10 2018