|
Search: id:A002301
|
|
|
| A002301 |
|
n!/3.
(Formerly M1861 N0737)
|
|
+0
9
|
|
| 2, 8, 40, 240, 1680, 13440, 120960, 1209600, 13305600, 159667200, 2075673600, 29059430400, 435891456000, 6974263296000, 118562476032000, 2134124568576000, 40548366802944000, 810967336058880000
(list; graph; listen)
|
|
|
OFFSET
|
3,1
|
|
|
COMMENT
|
a(n) is the number of n-permutations having 1, 2 and 3 in the same cycle. [From Geoffrey Critzer (critzer.geoffrey(AT)usd443.org), Apr 26 2009]
a(n) is the total number of 3-cycles in all n-permutations. - N. J. A. Sloane, Jul 22 2009
|
|
REFERENCES
|
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).
Letterio Toscano, Sulla Derivata di Ordinen della Funzione tg(x), Tohoku Math. J., 42 (1936), 144-154.
|
|
LINKS
|
N. J. A. Sloane, Table of n, a(n) for n = 3..30
Index entries for sequences related to factorial numbers
|
|
MATHEMATICA
|
f[n_]:=n!/3; Array[f, 4!, 3] [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Oct 21 2009]
|
|
CROSSREFS
|
Sequence in context: A089603 A116456 A055882 this_sequence A000828 A111394 A140363
Adjacent sequences: A002298 A002299 A002300 this_sequence A002302 A002303 A002304
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
