Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A161130
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A161130 Sum of the differences between the largest and the smallest fixed points over all non-derangement permutations of {1,2,...,n}. +0
2
0, 0, 1, 2, 13, 74, 523, 4178, 37609, 376082, 4136911, 49642922, 645357997, 9035011946, 135525179203, 2168402867234, 36862848742993, 663531277373858, 12607094270103319, 252141885402066362, 5294979593443393621 (list; graph; listen)
OFFSET

0,4

COMMENT

a(n)=A000166(n+1)-A155521(n).

a(n)=Sum(k*A161129(n,k),k=0..n-1).

REFERENCES

E. Deutsch and S. Elizalde, The largest and the smallest fixed points of permutations, arXiv:0904.2792v1, 2009.

FORMULA

E.g.f.: G=[exp(-x)*(1+x+x^2) - 1]/(1-x)^2.

EXAMPLE

a(3)=2 because the non-derangements of {1,2,3} are 1'23', 1'32, 213', and 32'1 with differences between the largest and smallest fixed points (marked) equal to 2, 0, 0, and 0, respectively.

a(4)=13 because the non-derangements of {1,2,3,4} are 1'234', 1'2'43, 1'423, 1'324', 1'342, 1'43'2, 413'2, 3124', 213'4', 42'13, 2314', 243'1, 42'3'1, 32'14', and 32'41 with differences between the largest and smallest fixed points (marked) equal to 3, 1, 0, 3, 0, 2, 0, 0, 1, 0, 0, 0, 1, 2, and 0, respectively.

MAPLE

G := (exp(-x)*(1+x+x^2)-1)/(1-x)^2: Gser := series(G, x = 0, 25): seq(factorial(n)*coeff(Gser, x, n), n = 0 .. 22);

CROSSREFS

A000166, A155521, A161129

Sequence in context: A163190 A004027 A154357 this_sequence A007509 A077413 A024199

Adjacent sequences: A161127 A161128 A161129 this_sequence A161131 A161132 A161133

KEYWORD

nonn

AUTHOR

Emeric Deutsch (deutsch(AT)duke.poly.edu), Jul 18 2009

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 24 14:25 EST 2009. Contains 167438 sequences.


AT&T Labs Research