Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A114312
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A114312 Number of partitions of n with at most 3 odd parts. +0
1
1, 2, 3, 4, 6, 8, 12, 14, 22, 24, 38, 39, 63, 62, 102, 95, 159, 144, 244, 212, 366, 309, 540, 442, 784, 626, 1125, 873, 1591, 1209, 2229, 1653, 3089, 2245, 4243, 3019, 5776, 4035, 7806, 5348, 10466, 7051, 13944, 9229, 18454, 12022, 24282, 15565, 31766, 20063 (list; graph; listen)
OFFSET

1,2

FORMULA

G.f.=(1+x/(1-x^2)+x^2/(1-x^2)/(1-x^4)+x^3/(1-x^2)/(1-x^4)/(1-x^6))/Product(1-x^(2*i), i=1..infinity).

EXAMPLE

a(6)=8 because we have 6,51,42,411,33,321,222, and 2211 (3111,21111, and 111111 do not qualify).

MAPLE

G:=(1+x/(1-x^2)+x^2/(1-x^2)/(1-x^4)+x^3/(1-x^2)/(1-x^4)/(1-x^6))/Product(1-x^(2*i), i=1..100): Gser:=series(G, x=0, 70): seq(coeff(Gser, x^n), n=1..60);

CROSSREFS

Cf. A100824, A100835.

Adjacent sequences: A114309 A114310 A114311 this_sequence A114313 A114314 A114315

Sequence in context: A028815 A014423 A101902 this_sequence A095041 A081029 A034893

KEYWORD

nonn

AUTHOR

Emeric Deutsch (deutsch(AT)duke.poly.edu), Feb 05 2006

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 October 12 15:26 EDT 2008. Contains 144830 sequences.


AT&T Labs Research