Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A129591
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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
1
2, 5, 17, 75, 407, 2619, 19487, 164571, 1555007, 16252779, 186167087, 2319025851, 31210884767, 451319283339, 6978220721807 (list; graph; listen)
OFFSET

1,1

FORMULA

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

CROSSREFS

Cf. A018927.

Sequence in context: A000774 A081046 A118100 this_sequence A099825 A014288 A020096

Adjacent sequences: A129588 A129589 A129590 this_sequence A129592 A129593 A129594

KEYWORD

nonn

AUTHOR

Vladeta Jovovic (vladeta(AT)eunet.rs), May 30 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 November 21 21:21 EST 2009. Contains 167310 sequences.


AT&T Labs Research