login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A239169 Number of partitions of 10^n into parts that are at most n with at least one part of each size. 2
0, 1, 49, 82834, 6934032777, 34711806631898612, 11573466447067793596124382, 275570877432663678053361428346732364, 492094366103239904094628894222685729680850442491, 68346513550765879549763426703232180189170804739067223698078512 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

Alois P. Heinz, Table of n, a(n) for n = 0..33

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^(10^n-n*(n+1)/2)] Product_{j=1..n} 1/(1-x^j).

a(n) ~ 10^(n*(n-1)) / (n!*(n-1)!). - Vaclav Kotesovec, Jun 05 2015

CROSSREFS

Column k=10 of A238012.

Sequence in context: A210819 A173171 A100418 * A134725 A203499 A013843

Adjacent sequences:  A239166 A239167 A239168 * A239170 A239171 A239172

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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 14 09:51 EST 2019. Contains 329111 sequences. (Running on oeis4.)