Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A058694
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A058694 Partial products p(0)*p(1)*...*p(n) of partition numbers A000041. +0
4
1, 1, 2, 6, 30, 210, 2310, 34650, 762300, 22869000, 960498000, 53787888000, 4141667376000, 418308404976000, 56471634671760000, 9939007702229760000, 2295910779215074560000, 681885501426877144320000, 262525918049347700563200000 (list; graph; listen)
OFFSET

0,3

COMMENT

a(n) gives the number of partitions P(V(n)) of V(n)=[1,2,3,...,n]. A partition P(V(n)) acts on the components of V(n), i.e. the components of V(n) are partitioned. Therefore a(n) results as the product of the number of partitions P(i) of the component v(i)=i with i=1,...,n. For example, a(3) = 6 because we have 6 list partitions for the list V(n=3)=[1,2,3]: [[1], [1, 1], [2, 1]], [[1], [1, 1], [1, 1, 1]], [[1], [1, 1], [3]], [[1], [2], [2, 1]], [[1], [2], [1, 1, 1]], [[1], [2], [3]]. - Thomas Wieder (thomas.wieder(AT)t-online.de), Sep 29 2007

CROSSREFS

Cf. A000041, A000070.

Adjacent sequences: A058691 A058692 A058693 this_sequence A058695 A058696 A058697

Sequence in context: A002110 A118491 A088257 this_sequence A046853 A071290 A093449

KEYWORD

nonn

AUTHOR

njas, Dec 30 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 May 11 10:28 EDT 2008. Contains 139662 sequences.


AT&T Labs Research