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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A239167 Number of partitions of 8^n into parts that are at most n with at least one part of each size. 2
 0, 1, 31, 21590, 475473009, 399953578562811, 14325140434481169064975, 23442235543128214521886383970201, 1841132100297745277187328924904656111127054, 7197719612276659958196058354497691622150052900765626132 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS Alois P. Heinz, Table of n, a(n) for n = 0..35 A. V. Sills and D. Zeilberger, Formulae for the number of partitions of n into at most m parts (using the quasi-polynomial ansatz) (arXiv:1108.4391 [math.CO]) FORMULA a(n) = [x^(8^n-n*(n+1)/2)] Product_{j=1..n} 1/(1-x^j). a(n) ~ 8^(n*(n-1)) / (n!*(n-1)!). - Vaclav Kotesovec, Jun 05 2015 CROSSREFS Column k=8 of A238012. Sequence in context: A215610 A292009 A086122 * A263585 A176349 A262716 Adjacent sequences: A239164 A239165 A239166 * A239168 A239169 A239170 KEYWORD nonn AUTHOR Alois P. Heinz, Mar 11 2014 STATUS approved

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.

Last modified September 11 17:54 EDT 2024. Contains 375839 sequences. (Running on oeis4.)