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.

A054250 Triangular array T(n,0)= 1, T(n,k) = sum_{j=1..min(n,k)} (n-j+1)*T(j,k-j) if k>0.

This page as a plain text file.
%I A054250 #7 Mar 30 2012 16:48:46
%S A054250 1,1,1,1,2,3,1,3,5,8,1,4,7,12,20,1,5,9,16,28,45,1,6,11,20,36,60,95,1,
%T A054250 7,13,24,44,75,122,191,1,8,15,28,52,90,149,238,365,1,9,17,32,60,105,
%U A054250 176,285,444,676,1,10,19,36,68,120,203,332,523,806,1211
%N A054250 Triangular array T(n,0)= 1, T(n,k) = sum_{j=1..min(n,k)} (n-j+1)*T(j,k-j) if k>0.
%e A054250 1; 1,1; 1,2,3; 1,3,5,8; 1,4,7,12,20; ...
%p A054250 A054250 := proc(n,k) option remember; local j; if k = 0 then RETURN(1) else add( (n-j+1)*A054250(j,k-j), j=1..min(n,k) ); fi; end;
%Y A054250 Used in A001523.
%K A054250 nonn,tabl,easy
%O A054250 0,5
%A A054250 _N. J. A. Sloane_, May 06 2000