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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A160979 Number of partitions of n where every part appears at least 9 times 2
0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 3, 3, 3, 5, 4, 5, 6, 6, 6, 10, 8, 9, 11, 12, 11, 14, 13, 15, 19, 17, 18, 22, 21, 23, 25, 25, 26, 33, 31, 34, 37, 39, 40, 50, 46, 52, 59, 62, 65, 75, 74, 82, 89, 98, 98, 118, 115, 128, 138, 147, 153, 173, 174, 194, 208, 220, 228, 256 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,18
LINKS
FORMULA
a(n) ~ sqrt(Pi^2 + 6*c) * exp(sqrt((2*Pi^2/3 + 4*c)*n)) / (4*sqrt(3)*Pi*n), where c = Integral_{0..infinity} log(1 - exp(-x) + exp(-9*x)) dx = -1.177746328175383925002682189470669316299189793135604988217... . - Vaclav Kotesovec, Jan 05 2016
MATHEMATICA
nmax = 100; Rest[CoefficientList[Series[Product[1 + x^(9*k)/(1-x^k), {k, 1, nmax}], {x, 0, nmax}], x]] (* Vaclav Kotesovec, Nov 28 2015 *)
CROSSREFS
Sequence in context: A161084 A161300 A161275 * A323287 A167679 A051881
KEYWORD
nonn
AUTHOR
R. H. Hardin Jun 01 2009
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 18:16 EDT 2024. Contains 371916 sequences. (Running on oeis4.)