Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A055922
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A055922 Number of partitions of n in which each part occurs an odd number (or 0) times. +0
9
1, 1, 1, 3, 2, 5, 6, 9, 9, 16, 20, 25, 32, 40, 54, 69, 84, 101, 136, 156, 202, 244, 306, 357, 448, 527, 652, 773, 944, 1103, 1346, 1574, 1885, 2228, 2640, 3106, 3684, 4302, 5052, 5931, 6924, 8079, 9416, 10958, 12718, 14824, 17078, 19820, 22860, 26433 (list; graph; listen)
OFFSET

0,4

REFERENCES

F. C. Auluck, K. S. Singwi and B. K. Agarwala, On a new type of partition, Proc. Nat. Inst. Sci. India 16 (1950) 147-156.

FORMULA

EULER transform of b where b has g.f. Sum {k>0} c(k)*x^k/(1-x^k) where c is inverse EULER transform of characteristic function of odd numbers.

G.f.: Product_{i>0} (1+x^i-x^(2*i))/(1-x^(2*i)). - Vladeta Jovovic (vladeta(AT)eunet.rs), Feb 03 2004

CROSSREFS

Cf. A000041, A007690, A055923.

Sequence in context: A154437 A083236 A079973 this_sequence A050061 A058638 A139140

Adjacent sequences: A055919 A055920 A055921 this_sequence A055923 A055924 A055925

KEYWORD

nonn

AUTHOR

Christian G. Bower (bowerc(AT)usa.net), Jun 23 2000

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 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research