|
Search: id:A058808
|
|
|
| A058808 |
|
Product{k=1 to n}[S(n,k)], where S(n,k) is a Stirling number of the second kind. (S(n,k) = number of ways of partitioning a set of n elements into k non-empty subsets.) |
|
+0 2
|
|
| 1, 1, 3, 42, 3750, 2720250, 19512927000, 1631977354072800, 1833446251541145780000, 31323109023670061678062500000, 9087660958278168844264470405352500000
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
EXAMPLE
|
a(4) = S(4,1) *S(4,2) *S(4,3) *S(4,4) = 1 *7 *6 *1 = 42.
|
|
MAPLE
|
a:=n->mul(stirling2(n, k), k=1..n): seq(a(n), n=1..12); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jun 28 2007
|
|
CROSSREFS
|
Sequence in context: A092470 A078601 A083402 this_sequence A137192 A059802 A139854
Adjacent sequences: A058805 A058806 A058807 this_sequence A058809 A058810 A058811
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Leroy Quet (qq-quet(AT)mindspring.com), Jan 02 2001
|
|
|
Search completed in 0.002 seconds
|