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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A145880 Triangle read by rows: T(n,k) is the number of odd permutations of {1,2,...,n} with no fixed points and having k excedances (n>=1; k>=1). 3
0, 1, 0, 0, 1, 4, 1, 0, 10, 10, 0, 1, 26, 81, 26, 1, 0, 56, 406, 406, 56, 0, 1, 120, 1681, 3816, 1681, 120, 1, 0, 246, 6210, 26916, 26916, 6210, 246, 0, 1, 502, 21433, 160054, 303505, 160054, 21433, 502, 1, 0, 1012, 70774, 852346, 2747008, 2747008, 852346, 70774 (list; graph; refs; listen; history; internal format)
OFFSET

1,6

COMMENTS

Row n has n-1 entries (n>=2).

Sum of entries in row n = A000387(n)=A145221(n).

Sum(k*T(n,k),k=1..n-1)=A145886(n) (n>=2).

REFERENCES

R. Mantaci and F. Rakotondrajao, Exceedingly deranging!, Advances in Appl. Math., 30 (2003), 177-188.

FORMULA

E.g.f.=Sum(t^exc(p)*z^n/n!)=[(1-t)*exp(-tz)/(1-t*exp((1-t)z))+(t*exp(-z)-exp(-tz))/(1-t)]/2.

EXAMPLE

T(4,2)=4 because the odd derangements of {1,2,3,4} with 2 excedances are 3142, 4312, 2413 and 3421.

Triangle starts:

0;

1;

0,0;

1,4,1;

0,10,10,0;

1,26,81,26,1;

MAPLE

G:=((1-t)*exp(-t*z)/(1-t*exp((1-t)*z))+(t*exp(-z)-exp(-t*z))/(1-t))*1/2: Gser:=simplify(series(G, z=0, 15)): for n to 11 do P[n]:=sort(expand(factorial(n)*coeff(Gser, z, n))) end do: 0; for n to 11 do seq(coeff(P[n], t, j), j=1..n-1) end do; # yields sequence in triangular form

CROSSREFS

A000387, A145221, A145886, A145881, A145887

Sequence in context: A095831 A089962 A127155 * A048516 A060638 A007789

Adjacent sequences:  A145877 A145878 A145879 * A145881 A145882 A145883

KEYWORD

nonn,tabf

AUTHOR

Emeric Deutsch (deutsch(AT)duke.poly.edu), Nov 06 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 01:56 EST 2012. Contains 205860 sequences.