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!)
A035977 Number of partitions of n into parts not of the form 19k, 19k+8 or 19k-8. Also number of partitions with at most 7 parts of size 1 and differences between parts at distance 8 are greater than 1. 0
1, 2, 3, 5, 7, 11, 15, 21, 29, 40, 52, 71, 92, 121, 156, 202, 256, 328, 412, 520, 649, 811, 1002, 1243, 1526, 1875, 2289, 2794, 3388, 4112, 4960, 5982, 7183, 8619, 10299, 12302, 14638, 17404, 20630, 24431, 28848, 34038, 40053, 47088, 55234 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Case k=9,i=8 of Gordon Theorem.
REFERENCES
G. E. Andrews, The Theory of Partitions, Addison-Wesley, 1976, p. 109.
LINKS
FORMULA
a(n) ~ exp(4*Pi*sqrt(2*n/57)) * 2^(3/4) * cos(3*Pi/38) / (3^(1/4) * 19^(3/4) * n^(3/4)). - Vaclav Kotesovec, May 10 2018
MATHEMATICA
nmax = 60; Rest[CoefficientList[Series[Product[(1 - x^(19*k))*(1 - x^(19*k+ 8-19))*(1 - x^(19*k- 8))/(1 - x^k), {k, 1, nmax}], {x, 0, nmax}], x]] (* Vaclav Kotesovec, May 10 2018 *)
CROSSREFS
Sequence in context: A246579 A232480 A332638 * A288256 A101049 A333193
KEYWORD
nonn,easy
AUTHOR
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 March 19 03:33 EDT 2024. Contains 370952 sequences. (Running on oeis4.)