login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A373433 a(n) = A000111(n) * A000142(n). Row sums of A373434. 3
1, 1, 2, 12, 120, 1920, 43920, 1370880, 55843200, 2879815680, 183330604800, 14122244505600, 1294628759424000, 139287595371724800, 17379949655535667200, 2489494639794978816000, 405724534220435189760000, 74646464089618378653696000, 15396938399483145082626048000 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
FORMULA
a(n) = n! * 2^n * |Euler(n, 1/2) + Euler(n, 1)| for n >= 1.
a(n) ~ ((2*n^2)/(Pi*e^2))^n*(8*n + 4/3).
MAPLE
A373433 := n -> ifelse(n = 0, 1, n! * 2^n * abs(euler(n, 1/2) + euler(n, 1))):
seq(A373433(n), n = 0..18);
MATHEMATICA
A373433[n_] := 2 I^(n + 1) n! PolyLog[-n, -I]; A373433[0] := 1;
Table[A373433[n], {n, 0, 18}]
PROG
(SageMath) # Algorithm of Ludwig Seidel (1877).
def A373433_list(n) :
R = []; S = []; A = {-1:0, 0:1}; k = 0; f = 1; e = 1
for i in (0..n) :
Am = 0; A[k + e] = 0; e = -e
for j in (0..i) : Am += A[k]; A[k] = Am; k += e
R.append(Am); S.append(f*Am); f *= i + 1
return S
print(A373433_list(18))
CROSSREFS
Sequence in context: A048800 A251185 A052738 * A229901 A007132 A138534
KEYWORD
nonn
AUTHOR
Peter Luschny, Jun 04 2024
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 9 02:21 EDT 2024. Contains 374171 sequences. (Running on oeis4.)