login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A160982 Number of partitions of n where every part appears at least 12 times 1
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 4, 2, 4, 4, 5, 4, 7, 5, 7, 7, 8, 7, 12, 9, 11, 12, 14, 12, 16, 14, 17, 17, 18, 17, 25, 20, 23, 24, 27, 26, 30, 27, 32, 32, 34, 32, 43, 37, 42, 44, 49, 47, 57, 52, 63, 61, 68, 66, 86, 77, 88, 89, 103, 98, 118, 112, 130 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,24

LINKS

R. H. Hardin, Table of n, a(n) for n=1..1000

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(-12*x)) dx = -1.250113645567074508329122746243739037481172772185350892378... . - Vaclav Kotesovec, Jan 05 2016

MATHEMATICA

nmax = 100; Rest[CoefficientList[Series[Product[1 + x^(12*k)/(1-x^k), {k, 1, nmax}], {x, 0, nmax}], x]] (* Vaclav Kotesovec, Nov 28 2015 *)

CROSSREFS

Sequence in context: A161087 A161303 A161278 * A334541 A175150 A161236

Adjacent sequences:  A160979 A160980 A160981 * A160983 A160984 A160985

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 3 21:16 EDT 2021. Contains 346441 sequences. (Running on oeis4.)