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.

A238160 A skewed version of triangular array A029653.

This page as a plain text file.
%I A238160 #6 Feb 19 2014 12:03:14
%S A238160 1,0,2,0,1,2,0,0,3,2,0,0,1,5,2,0,0,0,4,7,2,0,0,0,1,9,9,2,0,0,0,0,5,16,
%T A238160 11,2,0,0,0,0,1,14,25,13,2,0,0,0,0,0,6,30,36,15,2,0,0,0,0,0,1,20,55,
%U A238160 49,17,2,0,0,0,0,0,0,7,50,91,64,19,2,0,0,0,0,0
%N A238160 A skewed version of triangular array A029653.
%C A238160 Triangle T(n,k), 0<=k<=n, read by rows, given by (0, 1/2, -1/2, 0, 0, 0, 0, 0, 0, 0, ...) DELTA (2, -1, 0, 0, 0, 0, 0, 0, 0, 0, ...) where DELTA is the operator defined in A084938.
%C A238160 Row sums are Fib(n+2).
%C A238160 Column sums are A003945(k).
%C A238160 Diagonal sums are (-1)^(n+1)*A109266(n+1).
%C A238160 T(3*n,2*n) = A029651(n).
%F A238160 G.f.: (1+x*y)/(1-x*y-x^2*y).
%F A238160 T(n,k) = T(n-1,k-1) + T(n-2,k-1), T(0,0) = 1, T(1,0) = 0, T(1,1) = 2, T(n,k) = 0 if k<0 or if k>n.
%F A238160 Sum_{k=0..n} T(n,k)*x^k = A000007(n), A000045(n+2), A026150(n+1), A108306(n), A164545(n), A188168(n+1) for x = 0, 1, 2, 3, 4, 5 respectively.
%e A238160 Triangle begins:
%e A238160 1;
%e A238160 0, 2;
%e A238160 0, 1, 2;
%e A238160 0, 0, 3, 2;
%e A238160 0, 0, 1, 5, 2;
%e A238160 0, 0, 0, 4, 7, 2;
%e A238160 0, 0, 0, 1, 9, 9, 2;
%e A238160 0, 0, 0, 0, 5, 16, 11, 2;
%e A238160 0, 0, 0, 0, 1, 14, 25, 13, 2;
%e A238160 0, 0, 0, 0, 0, 6, 30, 36, 15, 2;
%e A238160 0, 0, 0, 0, 0, 1, 20, 55, 49, 17, 2;
%e A238160 0, 0, 0, 0, 0, 0, 7, 50, 91, 64, 19, 2;
%e A238160 ...
%Y A238160 Cf. A029635, A029653, A178524.
%K A238160 easy,nonn,tabl
%O A238160 0,3
%A A238160 _Philippe Deléham_, Feb 18 2014