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

 

Logo

Annual Appeal: Today, Nov 11 2014, is the 4th anniversary of the launch of the new OEIS web site. 70,000 sequences have been added in these four years, all edited by volunteers. Please make a donation (tax deductible in the US) to help keep the OEIS running.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A100835 Number of partitions of n with at most 2 odd parts. 2
1, 1, 2, 2, 4, 4, 8, 7, 14, 12, 24, 19, 39, 30, 62, 45, 95, 67, 144, 97, 212, 139, 309, 195, 442, 272, 626, 373, 873, 508, 1209, 684, 1653, 915, 2245, 1212, 3019, 1597, 4035, 2087, 5348, 2714, 7051, 3506, 9229, 4508, 12022, 5763, 15565, 7338, 20063, 9296, 25722 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

Alois P. Heinz, Table of n, a(n) for n = 0..1000

FORMULA

G.f.: (1+x/(1-x^2)+x^2/(1-x^2)/(1-x^4))/Product(1-x^(2*i), i=1..infinity). More generally, g.f. for number of partitions of n with at most k odd parts is (1+Sum(x^i/Product(1-x^(2*j), j=1..i), i=1..k))/Product(1-x^(2*i), i=1..infinity).

EXAMPLE

a(5) = 4 because we have [5], [4,1], [3,2] and [2,2,1] (the partitions [3,1,1], [2,1,1,1] and [1,1,1,1,1] do not qualify).

MAPLE

g:=(1+x/(1-x^2)+x^2/(1-x^2)/(1-x^4))/product(1-x^(2*i), i=1..40): gser:=series(g, x, 60): seq(coeff(gser, x, n), n=0..55); # Emeric Deutsch, Feb 16 2006

CROSSREFS

Cf. A000070, A008951, A000097, A000098, A000710.

Sequence in context: A191234 A225373 A138219 * A120541 A190172 A059867

Adjacent sequences:  A100832 A100833 A100834 * A100836 A100837 A100838

KEYWORD

easy,nonn

AUTHOR

Vladeta Jovovic, Jan 13 2005

EXTENSIONS

More terms from Emeric Deutsch, Feb 16 2006

STATUS

approved

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

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

Last modified November 21 15:11 EST 2014. Contains 249783 sequences.