|
|
A143357
|
|
Floor((n-1)!/[n(n+1)]).
|
|
0
|
|
|
0, 0, 0, 0, 0, 2, 12, 70, 448, 3298, 27490, 255876, 2631876, 29652480, 363242880, 4807626352, 68375130352, 1040021719578, 16848351857178, 289631191449600, 5266021662720000, 100970241446066086, 2036233202495666086, 43086694564808294400, 954536002666522214400, 22095740802465792000000
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,6
|
|
COMMENTS
|
All terms are even.
|
|
REFERENCES
|
T. Andreescu, D. Andrica and Z. Feng, 104 Number Theory Problems (from the training of the USA IMO team), Birkhäuser, Boston, 2007, Introductory problem # 50, pp. 82,126,127.
|
|
LINKS
|
|
|
MAPLE
|
seq(floor(factorial(n-1)/(n*(n+1))), n=1..25);
|
|
MATHEMATICA
|
Table[Floor[(n-1)!/(n(n+1))], {n, 30}] (* Harvey P. Dale, Apr 11 2012 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|