Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A055923
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A055923 Number of partitions of n in which each part occurs a prime number (or 0) times. +0
3
1, 0, 1, 1, 1, 1, 3, 2, 3, 4, 4, 6, 8, 8, 10, 13, 13, 20, 20, 24, 26, 38, 35, 51, 51, 65, 67, 92, 86, 121, 117, 153, 155, 209, 197, 270, 262, 339, 341, 444, 425, 565, 555, 703, 711, 903, 884, 1135, 1128, 1397, 1430, 1766, 1757, 2193, 2214, 2691, 2762, 3344 (list; graph; listen)
OFFSET

0,7

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 prime numbers.

G.f.: Product(1+Sum(x^(i*prime(k)), k=1..infinity), i=1..infinity). - Vladeta Jovovic (vladeta(AT)Eunet.yu), Jan 08 2005

CROSSREFS

Cf. A000041, A007690, A055922.

Sequence in context: A077070 A075988 A029150 this_sequence A035634 A091563 A035366

Adjacent sequences: A055920 A055921 A055922 this_sequence A055924 A055925 A055926

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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research