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!)
A035974 Number of partitions of n into parts not of the form 19k, 19k+5 or 19k-5. Also number of partitions with at most 4 parts of size 1 and differences between parts at distance 8 are greater than 1. 0
1, 2, 3, 5, 6, 10, 13, 19, 25, 35, 45, 62, 79, 104, 133, 173, 217, 279, 348, 440, 546, 683, 840, 1043, 1275, 1567, 1907, 2328, 2815, 3416, 4111, 4957, 5940, 7125, 8498, 10148, 12055, 14327, 16959, 20075, 23673, 27920, 32816, 38562, 45185, 52923 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Case k=9,i=5 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(9*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+ 5-19))*(1 - x^(19*k- 5))/(1 - x^k), {k, 1, nmax}], {x, 0, nmax}], x]] (* Vaclav Kotesovec, May 10 2018 *)
CROSSREFS
Sequence in context: A035959 A036801 A035966 * A035983 A035993 A036004
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 April 19 18:05 EDT 2024. Contains 371798 sequences. (Running on oeis4.)