login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A036022
Number of partitions of n into parts not of form 4k+2, 16k, 16k+5 or 16k-5.
0
1, 1, 1, 2, 3, 3, 4, 6, 8, 10, 12, 15, 20, 24, 28, 36, 45, 53, 63, 77, 93, 110, 129, 154, 185, 216, 251, 297, 350, 405, 469, 548, 638, 736, 846, 978, 1131, 1295, 1480, 1701, 1951, 2222, 2529, 2886, 3288, 3730, 4224, 4793, 5436, 6138, 6921, 7819, 8823, 9922, 11150
OFFSET
0,4
COMMENTS
Case k=4,i=3 of Gordon/Goellnitz/Andrews Theorem.
Also number of partitions in which no odd part is repeated, with at most 2 parts of size less than or equal to 2 and where differences between parts at distance 3 are greater than 1 when the larger part is odd and greater than 2 when the larger part is even.
Euler transform of period 16 sequence [1,0,1,1,0,0,1,1,1,0,0,1,1,0,1,0,...]. - Michael Somos, Jul 15 2004
REFERENCES
G. E. Andrews, The Theory of Partitions, Addison-Wesley, 1976, p. 114.
FORMULA
a(n) ~ 3^(1/4) * sqrt(2 + sqrt(2 - sqrt(2))) * exp(sqrt(3*n/2)*Pi/2) / (2^(15/4) * n^(3/4)). - Vaclav Kotesovec, May 09 2018
PROG
(PARI) a(n)=if(n<0, 0, polcoeff(1/prod(k=1, n, 1-([1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0][(k-1)%16+1])*x^k, 1+x*O(x^n)), n))
CROSSREFS
Sequence in context: A036021 A036025 A036030 * A036026 A116494 A036031
KEYWORD
nonn,easy
STATUS
approved