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 A177995 #4 Jun 22 2021 14:40:05 %S A177995 1,2,1,2,0,3,2,0,6,5,2,0,6,0,13,2,0,6,0,26,21,2,0,6,0,26,0,55,2,0,6,0, %T A177995 26,0,110,89,2,0,6,0,26,0,110,0,233,2,0,6,0,26,0,110,0,466,377,1,0,6, %U A177995 0,26,0,110,0,466,0,987 %N A177995 Triangle, row sums = odd Fibonacci numbers, A014437. %C A177995 Row sums = A014437 starting (1, 3, 5, 13, 21, 55, 89, 233, 377,...). The generating triangle M (alternate columns of (1,2,2,2,...) and (1,0,0,0,...) has an eigensequence of (1, 3, 5, 13, 21, 55, 89,...); i.e., the odd Fibonacci numbers; such that M * (1, 1, 3, 5, 13,...) shifts the latter sequence to the left. %C A177995 Sum of n-th row terms = rightmost term of next row. %F A177995 Let M = an infinite lower triangular matrix with alternate columns of %F A177995 (1,2,2,2,...) and (1,0,0,0,...). Let Q = A014437: (1, 1, 3, 5, 13, 21, 55,...); %F A177995 diagonalized with the rest zeros. Triangle A177995 = M * Q. %e A177995 First few rows of the triangle = %e A177995 1; %e A177995 2, 1; %e A177995 2, 0, 3; %e A177995 2, 0, 6, 5; %e A177995 2, 0, 6, 0, 13; %e A177995 2, 0, 6, 0, 26, 21; %e A177995 2, 0, 6, 0, 26, 0, 55; %e A177995 2, 0, 6, 0, 26, 0, 110, 89; %e A177995 2, 0, 6, 0, 26, 0, 110, 0, 233; %e A177995 2, 0, 6, 0, 26, 0, 110, 0, 466, 377; %e A177995 2, 0, 6, 0, 26, 0, 110, 0, 466, 0, 987; %e A177995 2, 0, 6, 0, 26, 0, 110, 0, 466, 0, 1974, 1597; %e A177995 ... %Y A177995 Cf. A014437. %K A177995 nonn,tabl %O A177995 1,2 %A A177995 _Gary W. Adamson_, May 16 2010