OFFSET
0,4
COMMENTS
For n >= 3, a(n) = number whose factorial base representation (A007623) begins with digit {n-2} followed by n-1 zeros. Viewed in that base, this sequence looks like this: 0, 0, 0, 100, 2000, 30000, 400000, 5000000, 60000000, 700000000, 8000000000, 90000000000, A00000000000, B000000000000, ... (where "digits" A and B stand for placeholder values 10 and 11 respectively). - Antti Karttunen, May 07 2015
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 0..300
Milan Janjic, Enumerative Formulas for Some Functions on Finite Sets.
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 514.
Luis Manuel Rivera, Integer sequences and k-commuting permutations, arXiv preprint, arXiv:1406.3081 [math.CO], 2014-2015.
FORMULA
E.g.f.: x^3/(-1+x)^2.
Recurrence: {a(1)=0, a(0)=0, a(2)=0, a(3)=6, (1-n^2)*a(n)+(-2+n)*a(n+1)=0}.
For n >= 2, a(n) = (n-2)*n!.
a(n+2) = n*(n+1)*(n+2)*n!. - Zerinvary Lajos, Nov 25 2006
From Amiram Eldar, Jan 14 2021: (Start)
MAPLE
spec := [S, {S=Prod(Z, Z, Z, Sequence(Z), Sequence(Z))}, labeled]: seq(combstruct[count](spec, size=n), n=0..20);
[seq (n*(n+1)*(n+2)*n!, n=0..17)]; # Zerinvary Lajos, Nov 25 2006
a:=n->add((n!), j=1..n-2):seq(a(n), n=0..21); # Zerinvary Lajos, Aug 27 2008
G(x):=x^3/(1-x)^2: f[0]:=G(x): for n from 1 to 21 do f[n]:=diff(f[n-1], x) od: x:=0: seq(f[n], n=0..19); # Zerinvary Lajos, Apr 01 2009
MATHEMATICA
Table[Sum[n!, {i, 3, n}], {n, 0, 19}] (* Zerinvary Lajos, Jul 12 2009 *)
PROG
(Magma) [0, 0], [n*(n+1)*(n+2)*Factorial(n): n in [0..20]]; // Vincenzo Librandi, Oct 11 2011
(Scheme) (define (A052571 n) (if (< n 2) 0 (* (- n 2) (A000142 n)))) ;; Antti Karttunen, May 07 2015
CROSSREFS
Cf. sequences with formula (n + k)*n! listed in A282466.
KEYWORD
easy,nonn
AUTHOR
encyclopedia(AT)pommard.inria.fr, Jan 25 2000
STATUS
approved