login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A018927 For each permutation p of {1,2,...,n} define maxjump(p) = max(p(i) - i); a(n) is sum of maxjumps of all p. 4
0, 1, 7, 45, 313, 2421, 20833, 198309, 2073793, 23664021, 292834513, 3907994949, 55967406433, 856355084661, 13944569166193, 240803714700069, 4395998055854593, 84596337986326101, 1711691067680320273 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

FORMULA

a(n) = Sum_{k=0..n-1} k*k!*((k+1)^(n-k)-k^(n-k)).

a(n) = Sum_{k=0..n*(n-1)/2} k*A127452(n-1,k). - Paul D. Hanna (pauldhanna(AT)juno.com), Jan 15 2007

CROSSREFS

Cf. A127452, A130153.

Sequence in context: A143835 A103719 A134437 * A001266 A071971 A006680

Adjacent sequences:  A018924 A018925 A018926 * A018928 A018929 A018930

KEYWORD

nonn,changed

AUTHOR

Emeric Deutsch (deutsch(AT)duke.poly.edu)

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 21:30 EST 2012. Contains 205971 sequences.