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.

A342315 T(n, k) = [x^k] 2^n*(Euler(n, x) - Euler(n, x/2)), where Euler(n, x) are the Euler polynomials. Triangle read by rows, T(n, k) for 0 <= k <= n.

Table of values

n a(n)
0 0
1 0
2 1
3 0
4 -2
5 3
6 0
7 0
8 -9
9 7
10 0
11 8
12 0
13 -28
14 15
15 0
16 0
17 60
18 0
19 -75
20 31
21 0
22 -96
23 0
24 280
25 0
26 -186
27 63
28 0
29 0
30 -1008
31 0
32 1050
33 0
34 -441
35 127
36 0
37 2176
38 0
39 -6272
40 0
41 3472
42 0
43 -1016
44 255
45 0
46 0
47 29376
48 0
49 -30240
50 0
51 10584
52 0
53 -2295
54 511
55 0
56 -79360
57 0
58 228480
59 0
60 -124992
61 0
62 30480
63 0
64 -5110
65 1023

List of values

[0, 0, 1, 0, -2, 3, 0, 0, -9, 7, 0, 8, 0, -28, 15, 0, 0, 60, 0, -75, 31, 0, -96, 0, 280, 0, -186, 63, 0, 0, -1008, 0, 1050, 0, -441, 127, 0, 2176, 0, -6272, 0, 3472, 0, -1016, 255, 0, 0, 29376, 0, -30240, 0, 10584, 0, -2295, 511, 0, -79360, 0, 228480, 0, -124992, 0, 30480, 0, -5110, 1023]