|
Search: id:A033312
|
|
| |
|
| 0, 0, 1, 5, 23, 119, 719, 5039, 40319, 362879, 3628799, 39916799, 479001599, 6227020799, 87178291199, 1307674367999, 20922789887999, 355687428095999, 6402373705727999, 121645100408831999, 2432902008176639999
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
COMMENT
|
a(n) gives the index number in any table of permutations of the entry in which the last n+1 items are reversed. - Eugene McDonnell (eemcd(AT)mac.com), Dec 03 2004
|
|
REFERENCES
|
Problem 598, J. Rec. Math., 11 (1978), 68-69.
A. T. Benjamin and J. J. Quinn, Proofs that really count: the art of combinatorial proof, M.A.A. 2003, id. 181.
|
|
LINKS
|
Hisanori Mishima, Factorizations of many number sequences
Hisanori Mishima, Factorizations of many number sequences
Andrew Walker, Factors of n! +- 1
Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.
Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.
R. G. Wilson v, Explicit factorizations
Index entries for sequences related to factorial numbers
G. P. Michon, Wilson's Theorem
|
|
FORMULA
|
Equals Sum_{k=1..n} k*k!.
a(n) = a(n-1)*(n-1) + a(n-1) + n-1, a(0)=0. - Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), Feb 03 2003
|
|
CROSSREFS
|
Cf. A000142, A038507.
Cf. A002582; A054415; A056110; A002982.
Adjacent sequences: A033309 A033310 A033311 this_sequence A033313 A033314 A033315
Sequence in context: A104090 A073596 A005393 this_sequence A121636 A020032 A009321
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Eric Weisstein (eric(AT)weisstein.com)
|
|
|
Search completed in 0.002 seconds
|
