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!)
 A119271 Triangle: number of exactly (m-1)-dimensional partitions of n, for n >= 1, m >= 0. 3
 1, 0, 1, 0, 1, 1, 0, 1, 3, 1, 0, 1, 5, 6, 1, 0, 1, 9, 18, 10, 1, 0, 1, 13, 44, 49, 15, 1, 0, 1, 20, 97, 172, 110, 21, 1, 0, 1, 28, 195, 512, 550, 216, 28, 1, 0, 1, 40, 377, 1370, 2195, 1486, 385, 36, 1, 0, 1, 54, 694, 3396, 7603, 7886, 3514, 638, 45, 1, 0, 1, 75, 1251, 7968 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 1,9 COMMENTS The partition of 1 is considered to be dimension -1 by convention. LINKS Suresh Govindarajan, Rows n = 1..26 of Triangle Suresh Govindarajan, Partitions Generator (gives partitions of integers <= 25 in any dimension using this triangle). Suresh Govindarajan, Refined counting of higher-dimensional partitions Suresh Govindarajan, Notes on higher-dimensional partitions, arXiv preprint arXiv:1203.4419, 2012. FORMULA a(n,m) = A096806(n,m-1)-a(n,m-1). Binomial transform of n-th row lists the (m-1) dimensional partitions of n. EXAMPLE Table starts: 1, 0,1, 0,1,1, 0,1,3,1, 0,1,5,6,1, CROSSREFS Cf. A119270, A096806. Column 1 is A007042. Sequence in context: A081719 A327618 A121314 * A323222 A125104 A098157 Adjacent sequences:  A119268 A119269 A119270 * A119272 A119273 A119274 KEYWORD nonn,tabl,hard AUTHOR Franklin T. Adams-Watters, May 11 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 October 1 15:55 EDT 2020. Contains 337443 sequences. (Running on oeis4.)