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.

A167371 Triangle, read by rows, given by [0,1,-1,0,0,0,0,0,0,0,0,...] DELTA [1,0,-1,1,0,0,0,0,0,0,0,...] where DELTA is the operator defined in A084938.

This page as a plain text file.
%I A167371 #11 Jan 26 2020 21:01:40
%S A167371 1,0,1,0,1,1,0,0,1,1,0,0,0,1,1,0,0,0,0,1,1,0,0,0,0,0,1,1,0,0,0,0,0,0,
%T A167371 1,1,0,0,0,0,0,0,0,1,1,0,0,0,0,0,0,0,0,1,1,0,0,0,0,0,0,0,0,0,1,1,0,0,
%U A167371 0,0,0,0,0,0,0,0,1,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,1,1
%N A167371 Triangle, read by rows, given by [0,1,-1,0,0,0,0,0,0,0,0,...] DELTA [1,0,-1,1,0,0,0,0,0,0,0,...] where DELTA is the operator defined in A084938.
%C A167371 Diagonal sums: A060576.
%C A167371 A167374*A154325 formatted as lower triangular matrix. - _Philippe Deléham_, Nov 19 2009
%F A167371 Sum_{k=0..n} T(n,k)*x^k = A000007(n), A046698(n+1), A111286(n+1), A027327(n) for x= 0, 1, 2, 3 respectively.
%F A167371 G.f.: (1+x^2*y)/(1-x*y). - _Philippe Deléham_, Nov 09 2013
%F A167371 T(n,k) = T(n-1,k-1) for n > 2, T(0,0) = T(1,1) = T(2,1) = T(2,2) = 1, T(1,0) = T(2,0) = 0, T(n,k) = 0 if k < 0 or if k > n. - _Philippe Deléham_, Nov 09 2013
%e A167371 Triangle begins:
%e A167371   1;
%e A167371   0, 1;
%e A167371   0, 1, 1;
%e A167371   0, 0, 1, 1;
%e A167371   0, 0, 0, 1, 1;
%e A167371   0, 0, 0, 0, 1, 1; ...
%Y A167371 Cf. A097806, A103451.
%K A167371 nonn,tabl
%O A167371 0,1
%A A167371 _Philippe Deléham_, Nov 02 2009