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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A034891 Number of different products of partitions of n; number of partitions of n into prime parts (1 included); number of distinct orders of Abelian subgroups of symmetric group S_n. 9
1, 1, 2, 3, 4, 6, 8, 11, 14, 18, 23, 29, 36, 45, 55, 67, 81, 98, 117, 140, 166, 196, 231, 271, 317, 369, 429, 496, 573, 660, 758, 869, 993, 1133, 1290, 1465, 1662, 1881, 2125, 2397, 2699, 3035, 3407, 3820, 4276, 4780, 5337, 5951, 6628, 7372, 8191, 9090 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

LINKS

T. D. Noe, Table of n, a(n) for n=1..1000

FORMULA

G.f.: (1/(1-x))*(1/Product_{k>0} (1-x^prime(k))). a(n) = (1/n)*Sum_{k=1..n} A074372(k)*a(n-k). Partial sums of A000607. - Vladeta Jovovic (vladeta(AT)eunet.rs), Sep 19 2002

MATHEMATICA

Table[ Length[ Union[ Apply[ Times, Partitions[ n ], 1 ] ] ], {n, 30} ]

CROSSREFS

Cf. A000792, A000793, A009490.

Sequence in context: A114829 A175869 A007279 * A143611 A062464 A053270

Adjacent sequences:  A034888 A034889 A034890 * A034892 A034893 A034894

KEYWORD

nonn,easy,nice

AUTHOR

Wouter Meeussen (wouter.meeussen(AT)pandora.be)

EXTENSIONS

More terms from Vladeta Jovovic (vladeta(AT)eunet.rs)

a(0)=1 from Michael Somos Feb 05 2011

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 February 13 16:05 EST 2012. Contains 205522 sequences.