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.

A054115 Triangular array generated by its row sums: T(n,0)=1 for n >= 1, T(n,1)=r(n-1), T(n,k)=T(n,k-1)+r(n-k) for k=2,3,...,n, n >= 2, r(h)=sum of the numbers in row h of T.

This page as a plain text file.
%I A054115 #7 Jun 13 2013 04:40:43
%S A054115 1,1,1,1,2,3,1,6,8,9,1,24,30,32,33,1,120,144,150,152,153,1,720,840,
%T A054115 864,870,872,873,1,5040,5760,5880,5904,5910,5912,5913,1,40320,45360,
%U A054115 46080,46200,46224,46230,46232,46233,1,362880,403200
%N A054115 Triangular array generated by its row sums: T(n,0)=1 for n >= 1, T(n,1)=r(n-1), T(n,k)=T(n,k-1)+r(n-k) for k=2,3,...,n, n >= 2, r(h)=sum of the numbers in row h of T.
%e A054115 Rows:
%e A054115 1;
%e A054115 1,1;
%e A054115 1,2,3;
%e A054115 1,6,8,9;
%e A054115 1,24,30,32,33;
%e A054115 1,120,144,150,152,153;
%Y A054115 n-th row sum is A000142(n+1) = (n+1)!.
%Y A054115 T(n, n)=A007489(n) for n >= 1, T(n+1, 2)=A001048(n)
%K A054115 nonn,tabl,eigen
%O A054115 0,5
%A A054115 _Clark Kimberling_