|
Search: id:A060725
|
|
|
| A060725 |
|
E.g.f.: exp( -(x^5 / 5)) / (1 - x). |
|
+0
4
|
|
| 1, 1, 2, 6, 24, 96, 576, 4032, 32256, 290304, 2975616, 32731776, 392781312, 5106157056, 71486198784, 1070549415936, 17128790654976, 291189441134592, 5241409940422656, 99586788868030464, 1991897970827821056
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
a(n) is the number of permutations in the symmetric group S_n whose cycle decomposition contains no 5-cycle.
|
|
REFERENCES
|
R. P. Stanley, Enumerative Combinatorics, Wadsworth, Vol. 1, 1986, page 93, problem 7.
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=0,...,100
|
|
FORMULA
|
The formula for a(n) is: a(n) = n! * sum i=0 ... [ n/5 ]( (-1)^i /(i! * 5^i)) by this formula we have as n -> infinity: a(n)/n! ~ sum i >= 0 (-1)^i /(i! * 5^i) = e^(-1/5) or a(n) ~ e^(-1/5) * n! and using Stirling's formula in A000142: a(n) ~ e^(-1/5) * (n/e)^n * sqrt(2 * Pi * n)
|
|
EXAMPLE
|
a(5) = 96 because in S_5 the permutations with no 5-cycle are the complement of the 24 5-cycles so a(5) = 5! - 24 = 96.
|
|
MAPLE
|
for n from 0 to 30 do printf(`%d, `, n! * sum(( (-1)^i /(i! * 5^i)), i=0..floor(n/5))) od:
|
|
PROGRAM
|
(PARI) { for (n=0, 100, write("b060725.txt", n, " ", n! * sum(i=0, n\5, (-1)^i / (i! * 5^i))); ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jul 10 2009]
(PARI) {a(n) = if( n<0, 0, n! * polcoeff( exp( -(x^5 / 5) + x*O(x^n)) / (1 - x), n))} /* Michael Somos Jul 28 2009 */ - Entry improved by comments from Michael Somos Jul 28 2009
|
|
CROSSREFS
|
Cf. A000142, A000090, A000138, A000266, A060725.
Sequence in context: A147887 A053502 A053504 this_sequence A150299 A094012 A141253
Adjacent sequences: A060722 A060723 A060724 this_sequence A060726 A060727 A060728
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Avi Peretz (njk(AT)netvision.net.il), Apr 22 2001
|
|
EXTENSIONS
|
More terms from James A. Sellers (sellersj(AT)math.psu.edu), Apr 24 2001
Entry improved by comments from Michael Somos Jul 28 2009
|
|
|
Search completed in 0.002 seconds
|
