login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A035294 Number of ways to partition 2n into distinct positive integers. 12
1, 1, 2, 4, 6, 10, 15, 22, 32, 46, 64, 89, 122, 165, 222, 296, 390, 512, 668, 864, 1113, 1426, 1816, 2304, 2910, 3658, 4582, 5718, 7108, 8808, 10880, 13394, 16444, 20132, 24576, 29927, 36352, 44046, 53250, 64234, 77312, 92864, 111322, 133184, 159046 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

Also, number of partitions of 2n into odd numbers. - Vladeta Jovovic, Aug 17 2004

This sequence was originally defined as the expansion of sum ( q^n / product( 1-q^k, k=1..2*n), n=0..inf ). The present definition is due to Reinhard Zumkeller. Michael Somos points out that the equivalence of the two definitions follows from Andrews, page 19.

Also, number of partitions of 2n with max descent 1 and last part 1. - Wouter Meeussen, Mar 31 2013

REFERENCES

G. E. Andrews, The Theory of Partitions, Cambridge University Press, 1998, p. 19.

LINKS

Table of n, a(n) for n=0..44.

N. J. A. Sloane, Transforms

FORMULA

Expansion of sum ( q^n / product( 1-q^k, k=1..2*n), n=0..inf ).

a(n) = t(2*n, 0), t as defined in A079211.

G.f.: Product((1 + x^(8 * i + 1)) * (1 + x^(8 * i + 2))^2 * (1 + x^(8 * i + 3))^2 * (1 + x^(8 * i + 4))^3 * (1 + x^(8 * i + 5))^2 * (1 + x^(8 * i + 6))^2 * (1 + x^(8 * i + 7)) * (1 + x^(8 * i + 8))^3, i=0..infinity). - Vladeta Jovovic, Oct 10 2004

G.f.: (Sum_{k>=0} x^A074378(k))/(Product_{k>0} (1-x^k)) = f(x^3, x^5)/f(-x) . - Michael Somos, Nov 01 2005

f(a,b)=Sum_{k} a^((k^2+k)/2)*b^((k^2-k)/2) is Ramanujan's two-variable theta function and f(-x)=f(-x,-x^2).

Euler transform of period 16 sequence [ 1, 1, 2, 1, 2, 0, 1, 0, 1, 0, 2, 1, 2, 1, 1, 0, ...]. - Michael Somos, Aug 16 2007

EXAMPLE

a(4)=6 [8=7+1=6+2=5+3=5+2+1=4+3+1=2*4].

MATHEMATICA

Table[Count[Partitions[2 n], q_ /; Union[q] == Sort[q]], {n, 16}];

Table[Count[Partitions[2 n], q_ /; Count[q, _?EvenQ] == 0], {n, 16}];

Table[Count[Partitions[2 n], q_ /; Last[q] == 1 && Max[q - PadRight[Rest[q], Length[q]]] <= 1 ], {n, 16}];

(* Wouter Meeussen, Mar 31 2013 *)

PROG

(PARI) {a(n)=local(A); if(n<0, 0, n*=2; A=x*O(x^n); polcoeff( eta(x^2+A)/eta(x+A), n))}

CROSSREFS

Cf. A078408, A078406, A078407. a(n)=A000009(2n).

Cf. A079122, A079126, A079124, A079125, A067953.

Cf. A005408.

Sequence in context: A175826 A073470 A086182 * A073818 A143184 A116084

Adjacent sequences:  A035291 A035292 A035293 * A035295 A035296 A035297

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, R. W. Gosper

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified June 19 14:40 EDT 2013. Contains 226414 sequences.