Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A132961
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A132961 Total number of all distinct cycle sizes in all permutations of [n]. +0
6
1, 2, 9, 38, 215, 1384, 10409, 86946, 825075, 8541998, 97590779, 1205343952, 16148472977, 231416203212, 3560209750005, 58104163643054, 1008693571819919, 18477578835352366, 357476371577422955, 7258865626801695048 (list; graph; listen)
OFFSET

1,2

FORMULA

E.g.f.: 1/(1-x)*Sum_{k>0}(1-exp(-x^k/k)). Exponential convolution of A132960(n) and n!: a(n) = n!*Sum_{k=1..n} A132960(k)/k!.

MATHEMATICA

Rest[ Range[0, 21]! CoefficientList[ Series[1/(1 - x) Sum[1 - Exp[ -x^k/k], {k, 25}], {x, 0, 21}], x]] - Robert G. Wilson v (rgwv(AT)rgwv.com), Sep 13 2007

CROSSREFS

Cf. A000254, A132958, A132959, A132960, A132962, A132963.

Sequence in context: A057647 A162972 A069724 this_sequence A070017 A054129 A037737

Adjacent sequences: A132958 A132959 A132960 this_sequence A132962 A132963 A132964

KEYWORD

nonn

AUTHOR

Vladeta Jovovic (vladeta(AT)eunet.rs), Sep 06 2007

EXTENSIONS

More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Sep 13 2007

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 December 10 12:37 EST 2009. Contains 170569 sequences.


AT&T Labs Research