This site is supported by donations to The OEIS Foundation.



(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A000293 a(n) = number of solid (i.e., three-dimensional) partitions of n.
(Formerly M3392 N1371)

%I M3392 N1371

%S 1,1,4,10,26,59,140,307,684,1464,3122,6500,13426,27248,54804,108802,

%T 214071,416849,805124,1541637,2930329,5528733,10362312,19295226,

%U 35713454,65715094,120256653,218893580,396418699,714399381,1281403841,2287986987,4067428375,7200210523,12693890803,22290727268,38993410516,67959010130,118016656268,204233654229,352245710866,605538866862,1037668522922,1772700955975,3019333854177,5127694484375,8683676638832,14665233966068,24700752691832,41495176877972,69531305679518

%N a(n) = number of solid (i.e., three-dimensional) partitions of n.

%C An ordinary partition is a row of numbers in nondecreasing order whose sum is n. Here the numbers are in a three-dimensional pile, nondecreasing in the x-, y- and z-directions.

%C Finding a g.f. for this sequence is an unsolved problem. At first it was thought that it was given by A000294.

%C Equals A000041 convolved with A002836: [1, 0, 2, 5, 12, 24, 56, 113, ...] and row sums of the convolution triangle A161564. - _Gary W. Adamson_, Jun 13 2009

%D P. Bratley and J. K. S. McKay, Algorithm 313: Multi-dimensional partition generator, Comm. ACM, 10 (Issue 10, 1967), p. 666.

%D P. A. MacMahon, Memoir on the theory of partitions of numbers - Part VI, Phil. Trans. Roal Soc., 211 (1912), 345-373.

%D P. A. MacMahon, Combinatory Analysis. Cambridge Univ. Press, London and New York, Vol. 1, 1915 and Vol. 2, 1916; see vol. 2, p 332.

%D N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

%H Suresh Govindarajan, <a href="/A000293/b000293.txt">Table of n, a(n) for n = 0..72</a>

%H A. O. L. Atkin, P. Bratley, I. G. McDonald and J. K. S. McKay, <a href="/A000219/a000219.pdf">Some computations for m-dimensional partitions</a>, Proc. Camb. Phil. Soc., 63 (1967), 1097-1100. [Annotated scanned copy], <a href="http://dx.doi.org/10.1017/S0305004100042171">DOI</a>

%H Srivatsan Balakrishnan, Suresh Govindarajan and Naveen S. Prabhakar, <a href="http://arxiv.org/abs/1105.6231">On the asymptotics of higher-dimensional partitions</a>, arXiv:1105.6231.

%H Nicolas Destainville and Suresh Govindarajan, <a href="http://arxiv.org/abs/1406.5605">Estimating the asymptotics of solid partitions</a>, J. Stat. Phys. 158 (2015) 950-967; arXiv:1406.5605.

%H Suresh Govindarajan, <a href="http://boltzmann.wikidot.com/solid-partitions">Solid Partitions Project </a> Dec 14, 2010

%H D. E. Knuth, <a href="http://dx.doi.org/10.1090/S0025-5718-1970-0277401-7">A Note on Solid Partitions</a>, Math. Comp. 24, 955-961, 1970.

%H P. A. MacMahon, <a href="http://www.hti.umich.edu/cgi/t/text/text-idx?c=umhistmath;idno=ABU9009">Combinatory analysis</a>.

%H Ville Mustonen and R. Rajesh, <a href="http://arXiv.org/abs/cond-mat/0303607">Numerical Estimation of the Asymptotic Behaviour of Solid Partitions of an Integer</a>, J. Phys. A 36 (2003), no. 24, 6651-6659.

%H S. P. Naveen, <a href="http://www.physics.iitm.ac.in/~suresh/theses/NaveenThesis.pd">On The Asymptotics of Some Counting Problems in Physics</a>, Thesis, Bachelor of Technology, DEPARTMENT OF PHYSICS, INDIAN INSTITUTE OF TECHNOLOGY, MADRAS, May 2011.

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/SolidPartition.html">Solid Partition</a>

%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Solid_partition">Solid partition</a>

%e Examples for n=2 and n=3.

%e a(2) = 4: 2; 11 where the first 1 is at the origin and the second 1 is in the x, y or z direction.

%e a(3) = 10: 3; 21 where the 2 is at the origin and the 1 is on the x, y or z axis; 111 (a row of 3 ones on the x, y or z axes); and three 1's with one 1 at the origin and the other two 1's on two of the three axes.

%e From _Gus Wiseman_, Jan 22 2019: (Start)

%e The a(1) = 1 through a(4) = 26 solid partitions, represented as chains of chains of integer partitions:

%e ((1)) ((2)) ((3)) ((4))

%e ((11)) ((21)) ((22))

%e ((1)(1)) ((111)) ((31))

%e ((1))((1)) ((2)(1)) ((211))

%e ((11)(1)) ((1111))

%e ((2))((1)) ((2)(2))

%e ((1)(1)(1)) ((3)(1))

%e ((11))((1)) ((21)(1))

%e ((1)(1))((1)) ((11)(11))

%e ((1))((1))((1)) ((111)(1))

%e ((2))((2))

%e ((3))((1))

%e ((2)(1)(1))

%e ((21))((1))

%e ((11))((11))

%e ((11)(1)(1))

%e ((111))((1))

%e ((2)(1))((1))

%e ((1)(1)(1)(1))

%e ((11)(1))((1))

%e ((2))((1))((1))

%e ((1)(1))((1)(1))

%e ((1)(1)(1))((1))

%e ((11))((1))((1))

%e ((1)(1))((1))((1))

%e ((1))((1))((1))((1))

%e (End)

%t planePtns[n_]:=Join@@Table[Select[Tuples[IntegerPartitions/@ptn],And@@(GreaterEqual@@@Transpose[PadRight[#]])&],{ptn,IntegerPartitions[n]}];

%t solidPtns[n_]:=Join@@Table[Select[Tuples[planePtns/@y],And@@(GreaterEqual@@@Transpose[Join@@@(PadRight[#,{n,n}]&/@#)])&],{y,IntegerPartitions[n]}];

%t Table[Length[solidPtns[n]],{n,10}] (* _Gus Wiseman_, Jan 23 2019 *)

%Y Cf. A000041, A000219 (2-dim), A000294, A000334 (4-dim), A000390 (5-dim), A002835, A002836, A005980, A037452 (inverse Euler trans.), A080207, A007326, A000416 (6-dim), A000427 (7-dim), A179855 (8-dim).

%Y Cf. A161564. - _Gary W. Adamson_, Jun 13 2009

%Y Cf. A001970, A002974, A003293, A007713, A114736, A117433, A323657.

%K nonn,nice

%O 0,3

%A _N. J. A. Sloane_

%E More terms from the Mustonen and Rajesh article, May 02 2003

%E a(51)-a(62) found by _Suresh Govindarajan_ and students, Dec 14 2010

%E a(63)-a(68) found by _Suresh Govindarajan_ and students, Jun 01 2011

%E a(69)-a(72) found by _Suresh Govindarajan_ and Srivatsan Balakrishnan, Jan 03 2013

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 24 17:50 EDT 2019. Contains 324330 sequences. (Running on oeis4.)