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 A133566 #24 Jul 24 2024 02:09:58 %S A133566 1,0,1,0,1,1,0,0,0,1,0,0,0,1,1,0,0,0,0,0,1,0,0,0,0,0,1,1,0,0,0,0,0,0, %T A133566 0,1,0,0,0,0,0,0,0,1,1,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,1,1,0,0, %U A133566 0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,1 %N A133566 Triangle read by rows: (1,1,1,...) on the main diagonal and (0,1,0,1,...) on the subdiagonal. %C A133566 Usually regarded as a square matrix T when combined with other matrices and column vectors. %C A133566 Then T * V, where V = any sequence regarded as a column vector with offset 1 is a new sequence S [called an interpolation transform] given by S(2n) = V(2n), S(2n-1) = V(2n) + V(2n-1). Example: If T * [1,2,3,...], S = [1, 2, 5, 4, 9, 6, 13, 8, 17, ...) = A114752. A133080 is identical to A133566 except that the subdiagonal = (1,0,1,0,...). A133080 * [1,2,3,...] = A114753: (1, 3, 3, 7, 5, 11, 7, 15, 9, 19, ...). %C A133566 Triangle T(n,k), 0 <= k <= n, read by rows given by [0,1,-1,0,0,0,0,0,0,...] DELTA [1,0,-2,1,0,0,0,0,0,0,0,...] where DELTA is the operator defined in A084938. - _Philippe Deléham_, Dec 15 2007 %F A133566 Odd rows: (n-2) zeros followed by 1, 1. Even rows: (n-1) zeros followed by 1. %F A133566 Sum_{k=0..n} T(n,k) = A040001(n). - _Philippe Deléham_, Dec 15 2007 %F A133566 G.f.: (-1-x*y-x^2*y)*x*y/((-1+x*y)*(1+x*y)). - _R. J. Mathar_, Aug 11 2015 %e A133566 First few rows of the triangle: %e A133566 1; %e A133566 0, 1; %e A133566 0, 1, 1; %e A133566 0, 0, 0, 1; %e A133566 0, 0, 0, 1, 1; %e A133566 0, 0, 0, 0, 0, 1; %e A133566 ... %p A133566 A133566 := proc(n,k) %p A133566 if n = k then %p A133566 1; %p A133566 elif k=n-1 and type(n,odd) then %p A133566 1; %p A133566 else %p A133566 0 ; %p A133566 end if; %p A133566 end proc: # _R. J. Mathar_, Jun 20 2015 %t A133566 T[n_, k_] := Which[n == k, 1, k == n - 1 && OddQ[n], 1, True, 0]; %t A133566 Table[T[n, k], {n, 1, 14}, {k, 1, n}] // Flatten (* _Jean-François Alcover_, Aug 24 2023 *) %Y A133566 Cf. A133080, A114752, A114753, A084938, A040001. %K A133566 nonn,tabl,easy %O A133566 1,1 %A A133566 _Gary W. Adamson_, Sep 16 2007 %E A133566 Entry revised by _N. J. A. Sloane_, Jun 20 2015