|
Search: id:A028418
|
|
|
| A028418 |
|
Sum over all n! permutations of n letters of maximum cycle length. |
|
+0
7
|
|
| 1, 3, 13, 67, 411, 2911, 23563, 213543, 2149927, 23759791, 286370151, 3734929903, 52455166063, 788704078527, 12648867695311, 215433088624351, 3884791172487903, 73919882720901823, 1480542628345939807
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
REFERENCES
|
S. W. Golomb, Shift-Register Sequences, Holden-Day, San Francisco, 1967, p. 183.
|
|
LINKS
|
Ph. Flajolet and A. Odlyzko, Singularity analysis of generating functions, p. 22.
|
|
FORMULA
|
E.g.f.: Sum[k>=0, 1/(1-x) - exp(sum(j=1..k, x^j/j))].
|
|
CROSSREFS
|
Cf. A060014, A006128, A028417.
Sequence in context: A064062 A114191 A107592 this_sequence A080832 A020017 A060014
Adjacent sequences: A028415 A028416 A028417 this_sequence A028419 A028420 A028421
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Joe Keane (jgk(AT)jgk.org)
|
|
EXTENSIONS
|
More terms from Vladeta Jovovic (vladeta(AT)Eunet.yu), Sep 19 2002
|
|
|
Search completed in 0.002 seconds
|
