cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A345393 Array read by ascending antidiagonals: A(n, k) = n!*[x^(n-1)] Li(-k, 1 - exp(-4*x))/(4*x*cosh(x)), where Li(n, z) is the polylogarithm function.

Table of values

n a(n)
0 0
1 1
2 0
3 4
4 1
5 0
6 13
7 12
8 1
9 0
10 40
11 109
12 28
13 1
14 0
15 121
16 888
17 493
18 60
19 1
20 0
21 364
22 6841
23 7192
24 1837
25 124
26 1
27 0
28 1093
29 51012
30 95161
31 42840
32 6253
33 252
34 1
35 0
36 3280
37 372709
38 1189108
39 865081
40 220120
41 20269
42 508
43 1
44 0
45 9841
46 2687088
47 14331493
48 16022100
49 6396601
50 1040088
51 63853
52 1020
53 1
54 0

List of values

[0, 1, 0, 4, 1, 0, 13, 12, 1, 0, 40, 109, 28, 1, 0, 121, 888, 493, 60, 1, 0, 364, 6841, 7192, 1837, 124, 1, 0, 1093, 51012, 95161, 42840, 6253, 252, 1, 0, 3280, 372709, 1189108, 865081, 220120, 20269, 508, 1, 0, 9841, 2687088, 14331493, 16022100, 6396601, 1040088, 63853, 1020, 1, 0]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.