Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A036018
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A036018 Number of partitions of n into parts not of form 4k+2, 12k, 12k+3 or 12k-3. +0
4
1, 1, 1, 1, 2, 3, 3, 4, 6, 7, 8, 10, 13, 16, 18, 22, 28, 33, 38, 45, 55, 65, 74, 87, 104, 121, 138, 160, 188, 217, 247, 284, 330, 378, 428, 489, 562, 640, 722, 820, 936, 1059, 1191, 1345, 1524, 1717, 1924, 2163, 2438, 2734, 3054, 3419, 3834, 4284, 4770, 5321, 5943 (list; graph; listen)
OFFSET

0,5

COMMENT

Case k=3,i=2 of Gordon/Goellnitz/Andrews Theorem.

Also number of partitions in which no odd part is repeated, with at most 1 part of size less than or equal to 2 and where differences between parts at distance 2 are greater than 1 when the larger part is odd and greater than 2 when the larger part is even.

REFERENCES

G. E. Andrews, The Theory of Partitions, Addison-Wesley, 1976, p. 114.

LINKS

G. E. Andrews, Three aspects of partitions

FORMULA

Expansion of q^(-1/4)(eta(q^2)*eta(q^3)*eta(q^12))/(eta(q)*eta(q^4)*eta(q^6)) in powers of q. - Michael Somos Jun 28 2004

Euler transform of period 12 sequence [1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, ...]. - Michael Somos Jun 28 2004

Expansion of psi(-q^3) / psi(-q) in powers of q where psi() is a Ramanujan theta function. - Michael Somos Nov 21 2007

Given g.f. A(x), then B(x) = x * A(x^4) satisfies 0=f(B(x), B(x^3)) where f(u, v)= u^3 * (1 + v^4) - v * (1 + u*v)^3. - Michael Somos Nov 21 2007

G.f. is a period 1 Fourier series which satisfies f(-1 / (192 t)) = sqrt(1 / 3) / f(t) where q = exp(2 pi i t). - Michael Somos Nov 21 2007

EXAMPLE

q + q^5 + q^9 + q^13 + 2*q^17 + 3*q^21 + 3*q^25 + 4*q^29 + 6*q^33 + ...

PROGRAM

(PARI) {a(n) = if( n<0, 0, polcoeff( 1 / prod(k=1, n, 1 - ([1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0][(k-1)%12 + 1]) * x^k, 1 + x * O(x^n)), n))} /* Michael Somos Jun 28 2004 */

(PARI) {a(n) = local(A); if( n<0, 0, A = x*O(x^n); polcoeff( (eta(x^2 + A) * eta(x^3 + A) * eta(x^12 + A)) / (eta(x + A) * eta(x^4 + A) * eta(x^6 + A)), n))} /* Michael Somos Jun 28 2004 */

CROSSREFS

A101195(n)=(-1)^n*a(n).

Sequence in context: A029033 A041003 A067592 this_sequence A101195 A123552 A071610

Adjacent sequences: A036015 A036016 A036017 this_sequence A036019 A036020 A036021

KEYWORD

nonn,easy

AUTHOR

Olivier Gerard (olivier.gerard(AT)gmail.com)

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 14:49 EST 2009. Contains 167514 sequences.


AT&T Labs Research