|
Search: id:A058807
|
|
|
| A058807 |
|
Product{k=1 to n}[s(n,k)], where s(n,k) is unsigned Stirling number of the first kind. (s(n,k) = number of permutations of n elements which contain exactly k cycles.) |
|
+0
1
|
|
| 1, 1, 6, 396, 420000, 9432450000, 5571367220160000, 103458225408290423193600, 70288262635020872178876253470720, 1993179010286886206697449779415040000000000
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
LINKS
|
Leroy Quet, Home Page (listed in lieu of email address)
|
|
EXAMPLE
|
a(4) = s(4,1) *s(4,2) *s(4,3) *s(4,4) = 6 *11 *6 *1 = 396.
|
|
MAPLE
|
a:=n->mul(stirling1(n, k), k=1..n): seq(abs(a(n)), n=1..10); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jun 28 2007
|
|
CROSSREFS
|
Sequence in context: A060871 A162137 A119645 this_sequence A000474 A029591 A151578
Adjacent sequences: A058804 A058805 A058806 this_sequence A058808 A058809 A058810
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Leroy Quet Jan 02 2001
|
|
|
Search completed in 0.002 seconds
|
