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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A129591 For each permutation p of {1,2,...,n} define min(p) = min{ p(i) + i : i = 1..n }; a(n) is the sum of min(p) of all p. 0
2, 5, 17, 75, 407, 2619, 19487, 164571, 1555007, 16252779, 186167087, 2319025851, 31210884767, 451319283339, 6978220721807 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Table of n, a(n) for n=1..15.

FORMULA

Sum _{k=0..n-1} (n-k+1)*k!*((k+1)^(n-k)-k^(n-k)).

CROSSREFS

Cf. A018927.

Sequence in context: A260948 A259870 A118100 * A279208 A099825 A014288

Adjacent sequences:  A129588 A129589 A129590 * A129592 A129593 A129594

KEYWORD

nonn

AUTHOR

Vladeta Jovovic, May 30 2007

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 21 02:02 EDT 2019. Contains 325189 sequences. (Running on oeis4.)