id:A018927 - OEIS Search Results

Search: id:A018927

Displaying 1-1 of 1 results found.

page 1

For each permutation p of {1,2,...,n} define maxjump(p) = max(p(i) - i); a(n) is sum of maxjumps of all p.

+0
5

0, 1, 7, 45, 313, 2421, 20833, 198309, 2073793, 23664021, 292834513, 3907994949, 55967406433, 856355084661, 13944569166193, 240803714700069, 4395998055854593, 84596337986326101, 1711691067680320273 (list; graph; listen)

	OFFSET	`1,3`
	FORMULA	`Sum kk!{(k+1)^(n-k)-k^(n-k)}; k=0..n-1.` `a(n) = Sum_{k=0..n(n-1)/2} kA127452(n-1,k). - Paul D. Hanna (pauldhanna(AT)juno.com), Jan 15 2007`
	CROSSREFS	`Cf. A127452.` `Sequence in context: A143835 A103719 A134437 this_sequence A001266 A071971 A006680` `Adjacent sequences: A018924 A018925 A018926 this_sequence A018928 A018929 A018930`
	KEYWORD	`nonn`
	AUTHOR	`Emeric Deutsch (deutsch(AT)duke.poly.edu)`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research