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.
%I A104582 #9 Aug 18 2017 03:16:29 %S A104582 1,2,1,4,2,1,7,4,2,1,12,7,4,2,1,20,12,7,4,2,1,33,20,12,7,4,2,1,54,33, %T A104582 20,12,7,4,2,1,88,54,33,20,12,7,4,2,1,143,88,54,33,20,12,7,4,2,1,232, %U A104582 143,88,54,33,20,12,7,4,2,1,376,232,143,88,54,33,20,12,7,4,2,1,609,376,232 %N A104582 Triangle read by rows: T(i,j) is the (i,j)-entry (1 <= j <= i) of the product of the lower triangular matrix (Fibonacci(i-j+1)) and of the lower triangular matrix all of whose entries are equal to 1 (for j <= i). %F A104582 T(i, j) = Fibonacci(i-j+3) - 1 for 1 <= j <= i and 0 otherwise. - _Emeric Deutsch_, Mar 23 2005 %e A104582 The first few rows of the triangle are: %e A104582 1; %e A104582 2, 1; %e A104582 4, 2, 1; %e A104582 7, 4, 2, 1; %e A104582 12, 7, 4, 2, 1; %e A104582 ... %p A104582 with(combinat): for i from 1 to 13 do seq(fibonacci(i-j+3)-1,j=1..i) od; # yields sequence in triangular form # _Emeric Deutsch_, Mar 23 2005 %Y A104582 Sum of row n = Fibonacci(n+4) - n - 3 (A001924). Columns (starting from the diagonal entries) are the Fibonacci numbers -1 (A000071). %K A104582 nonn,tabl %O A104582 1,2 %A A104582 _Gary W. Adamson_, Mar 16 2005 %E A104582 More terms from _Emeric Deutsch_, Mar 23 2005