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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A001804 n!.C(n,2).
(Formerly M2109 N0834)
3
2, 18, 144, 1200, 10800, 105840, 1128960, 13063680, 163296000, 2195424000, 31614105600, 485707622400, 7933224499200, 137305808640000, 2510734786560000 (list; graph; refs; listen; history; internal format)
OFFSET

2,1

COMMENTS

Number of big descents in all permutations of [n+1]. A big descent in a permutation (x_1,x_2,...,x_n) is a position i such that x_i - x_(i+1) >= 2. Example: a(2)=2 because there are 2 big descents in the permutations 123, 132, 213, 23\1, 3\12, 321 of {1,2,3} (shown by a \). a(n)=Sum(k*A120434(n+1,k),k=0..n-1) - Emeric Deutsch (deutsch(AT)duke.poly.edu), Oct 01 2006

REFERENCES

M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 799.

N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

Milan Janjic, Enumerative Formulas for Some Functions on Finite Sets

M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].

Index entries for sequences related to factorial numbers

MAPLE

seq(n!*binomial(n, 2), n=2..20); - Emeric Deutsch (deutsch(AT)duke.poly.edu), Oct 01 2006

a:=n->sum((n-j)*n!, j=1..n): seq(a(n), n=2..22); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Apr 29 2007

restart: G(x):=x^2/(1-x)^3: f[0]:=G(x): for n from 1 to 18 do f[n]:=diff(f[n-1], x) od: x:=0: seq(f[n], n=2..16); # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Apr 01 2009]

CROSSREFS

Cf. A120434.

Sequence in context: A005544 A154636 A193446 * A052640 A037565 A125835

Adjacent sequences:  A001801 A001802 A001803 * A001805 A001806 A001807

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

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 15 17:13 EST 2012. Contains 205828 sequences.