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.

A141684 Triangle read by rows formed from Euler polynomials: p(x,n) = if(n mod 2 = 1, 2^(1 + ((n - 1)/2))*EulerE(n, x), EulerE(n, x)); t(n,m) = Coefficients(p(x,n)).

Table of values

n a(n)
1 1
2 -1
3 2
4 0
5 -1
6 1
7 1
8 0
9 -6
10 4
11 0
12 1
13 0
14 -2
15 1
16 -4
17 0
18 20
19 0
20 -20
21 8
22 0
23 -3
24 0
25 5
26 0
27 -3
28 1
29 34
30 0
31 -168
32 0
33 140
34 0
35 -56
36 16
37 0
38 17
39 0
40 -28
41 0
42 14
43 0
44 -4
45 1
46 -496
47 0
48 2448
49 0
50 -2016
51 0
52 672
53 0
54 -144
55 32
56 0
57 -155
58 0
59 255
60 0
61 -126
62 0
63 30
64 0
65 -5
66 1

List of values

[1, -1, 2, 0, -1, 1, 1, 0, -6, 4, 0, 1, 0, -2, 1, -4, 0, 20, 0, -20, 8, 0, -3, 0, 5, 0, -3, 1, 34, 0, -168, 0, 140, 0, -56, 16, 0, 17, 0, -28, 0, 14, 0, -4, 1, -496, 0, 2448, 0, -2016, 0, 672, 0, -144, 32, 0, -155, 0, 255, 0, -126, 0, 30, 0, -5, 1]