Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A090672
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A090672 (n^2-1)*n!/3. +0
4
0, 2, 16, 120, 960, 8400, 80640, 846720, 9676800, 119750400, 1596672000, 22832409600, 348713164800, 5666588928000, 97639686144000, 1778437140480000, 34145993097216000, 689322235650048000, 14597412049059840000, 323575967087493120000, 7493338185184051200000 (list; graph; listen)
OFFSET

1,2

COMMENT

a(n) = Sum_{pi in Symm(n)} Sum_{i=1..n} |pi(i)-i|, i.e. the total displacement of all letters in all permutations on n letters.

a(n)=number of entries between the entries 1 and 2 in all permutations of {1,2,...,n+1}. Example: a(2)=2 because we have 123, 1(3)2, 213, 2(3)1, 312, 321; the entries between 1 and 2 are surrounded by parentheses. - Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 06 2008

a(n)=Sum(k*A138770(n+1,k),k=0..n-1). - Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 06 2008

REFERENCES

D. Daly and P. Vojtechovsky, Displacement of permutations, preprint, 2003.

FORMULA

a(n)=A052571(n+2)/3 =2*A005990(n). - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), May 11 2007

MAPLE

a:=n->sum(sum(sum(n!/3, j=1..n), k=-1..n), m=0..n): seq(a(n), n=0..20); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), May 11 2007

CROSSREFS

Twice A005990.

Cf. A138770.

Adjacent sequences: A090669 A090670 A090671 this_sequence A090673 A090674 A090675

Sequence in context: A026129 A026158 A025185 this_sequence A027309 A069868 A022027

KEYWORD

nonn

AUTHOR

njas, Dec 18 2003

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 October 13 20:18 EDT 2008. Contains 145016 sequences.


AT&T Labs Research