|
Search: id:A060014
|
|
|
| A060014 |
|
Sum of orders of all permutations of n letters. |
|
+0
8
|
|
| 1, 3, 13, 67, 471, 3271, 31333, 299223, 3291487, 39020911, 543960561, 7466726983, 118551513523, 1917378505407, 32405299019941, 608246253790591, 12219834139189263, 253767339725277823, 5591088918313739017
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
REFERENCES
|
D. S. Mitrinovic et al., Handbook of Number Theory, Kluwer, Section XIII.2, p. 460.
|
|
FORMULA
|
E.g.f.: Sum_{n>0} (n*Sum_{i|n} (moebius(n/i)*Product_{j|i} exp(x^j/j))). - Vladeta Jovovic (vladeta(AT)eunet.rs), Dec 29 2004
|
|
EXAMPLE
|
For n = 4 there is 1 permutation of order 1, 9 permutations of order 2, 8 of order 3 and 6 of order 4, for a total of 67.
|
|
CROSSREFS
|
Cf. A028418, A060015.
Sequence in context: A028418 A080832 A020017 this_sequence A042659 A054132 A047149
Adjacent sequences: A060011 A060012 A060013 this_sequence A060015 A060016 A060017
|
|
KEYWORD
|
nonn,nice,easy
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Mar 17 2001
|
|
EXTENSIONS
|
More terms from Vladeta Jovovic (vladeta(AT)eunet.rs), Mar 18 2001
|
|
|
Search completed in 0.002 seconds
|
