This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A114329 Triangle T(n,k) = number of partitions of n-set into lists (cf. A000262) with k lists of size 1. 1
 1, 0, 1, 2, 0, 1, 6, 6, 0, 1, 36, 24, 12, 0, 1, 240, 180, 60, 20, 0, 1, 1920, 1440, 540, 120, 30, 0, 1, 17640, 13440, 5040, 1260, 210, 42, 0, 1, 183120, 141120, 53760, 13440, 2520, 336, 56, 0, 1, 2116800, 1648080, 635040, 161280, 30240, 4536, 504, 72, 0, 1 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 0,4 LINKS Nathaniel Johnston, Table of n, a(n) for n = 0..5150 FORMULA E.g.f.: exp(x/(1-x)+(y-1)*x). More generally, e.g.f. for number of partitions of n-set into lists with k lists of size m is exp(x/(1-x)+(y-1)*x^m). EXAMPLE Triangle begins: 1 0   1 2   0   1 6   6   0  1 36  24  12 0  1 240 180 60 20 0 1 ... MAPLE t:=taylor(exp(x/(1-x)+(y-1)*x), x, 11):for n from 0 to 10 do for k from 0 to n do printf("%d, ", coeff(n!*coeff(t, x, n), y, k)): od: printf("\n"): od: # Nathaniel Johnston, Apr 27 2011 CROSSREFS Cf. A000262, A052845. Sequence in context: A138106 A131689 A278075 * A241011 A220905 A226573 Adjacent sequences:  A114326 A114327 A114328 * A114330 A114331 A114332 KEYWORD easy,nonn,tabl AUTHOR Vladeta Jovovic, Feb 06 2006 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 September 22 05:47 EDT 2019. Contains 327287 sequences. (Running on oeis4.)