Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A058807
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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

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: A078207 A060871 A119645 this_sequence A000474 A029591 A106206

Adjacent sequences: A058804 A058805 A058806 this_sequence A058808 A058809 A058810

KEYWORD

easy,nonn

AUTHOR

Leroy Quet (qq-quet(AT)mindspring.com), Jan 02 2001

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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research