|
|
A129724
|
|
a(0) = 1; then a(n) = n!*(1 - (-1)^n*Bernoulli(n-1)).
|
|
4
|
|
|
1, 2, 3, 7, 24, 116, 720, 5160, 40320, 350784, 3628800, 42940800, 479001600, 4650877440, 87178291200, 2833294464000, 20922789888000, -2166903606067200, 6402373705728000, 6808619561103360000, 2432902008176640000, -26982365129174827008000, 1124000727777607680000
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
LINKS
|
|
|
MAPLE
|
a:= proc(n)
if n=0 and n>=0 then 1
elif n mod 2 = 0 then n!*(1 - bernoulli(n-1))
else n!*(1 + bernoulli(n-1))
fi; end;
|
|
MATHEMATICA
|
a[0] = 1; a[n_]:= n!*(1-(-1)^n*BernoulliB[n-1]); Table[a[n], {n, 0, 22}] (* Jean-François Alcover, Sep 16 2013 *)
|
|
PROG
|
(PARI) a(n) = if(n==0, 1, n!*(1 - (-1)^n*bernfrac(n-1)) ); \\ G. C. Greubel, Dec 03 2019
(Magma) [n eq 0 select 1 else Factorial(n)*(1 - (-1)^n*Bernoulli(n-1)): n in [0..25]]; // G. C. Greubel, Dec 03 2019
(Sage) [1]+[factorial(n)*(1 - (-1)^n*bernoulli(n-1)) for n in (1..25)] # G. C. Greubel, Dec 03 2019
(GAP) Concatenation([1], List([1..25], n-> Factorial(n)*(1 - (-1)^n*Bernoulli(n-1)) )); # G. C. Greubel, Dec 03 2019
|
|
CROSSREFS
|
|
|
KEYWORD
|
sign
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|