login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 3

%I #7 Mar 30 2012 16:48:46

%S 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 7,13,24,44,75,122,191,1,8,15,28,52,90,149,238,365,1,9,17,32,60,105,

%U 176,285,444,676,1,10,19,36,68,120,203,332,523,806,1211

%N 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 1; 1,1; 1,2,3; 1,3,5,8; 1,4,7,12,20; ...

%p 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 Used in A001523.

%K nonn,tabl,easy

%O 0,5

%A _N. J. A. Sloane_, May 06 2000

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 13:30 EDT 2024. Contains 371957 sequences. (Running on oeis4.)