The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 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
 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, 7, 13, 24, 44, 75, 122, 191, 1, 8, 15, 28, 52, 90, 149, 238, 365, 1, 9, 17, 32, 60, 105, 176, 285, 444, 676, 1, 10, 19, 36, 68, 120, 203, 332, 523, 806, 1211 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 0,5 LINKS EXAMPLE 1; 1,1; 1,2,3; 1,3,5,8; 1,4,7,12,20; ... MAPLE 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; CROSSREFS Used in A001523. Sequence in context: A194752 A194740 A194762 * A193923 A198811 A067337 Adjacent sequences:  A054247 A054248 A054249 * A054251 A054252 A054253 KEYWORD nonn,tabl,easy AUTHOR N. J. A. Sloane, May 06 2000 STATUS approved

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

Last modified August 13 00:27 EDT 2020. Contains 336441 sequences. (Running on oeis4.)