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.

A081733 Triangle read by rows, T(n,k) = 2^(n-k)*[x^k] Euler_polynomial(n, x), for n >= 0, k >= 0.

Table of values

n a(n)
0 1
1 -1
2 1
3 0
4 -2
5 1
6 2
7 0
8 -3
9 1
10 0
11 8
12 0
13 -4
14 1
15 -16
16 0
17 20
18 0
19 -5
20 1
21 0
22 -96
23 0
24 40
25 0
26 -6
27 1
28 272
29 0
30 -336
31 0
32 70
33 0
34 -7
35 1
36 0
37 2176
38 0
39 -896
40 0
41 112
42 0
43 -8
44 1
45 -7936
46 0
47 9792
48 0
49 -2016
50 0
51 168
52 0
53 -9
54 1
55 0
56 -79360
57 0
58 32640
59 0
60 -4032
61 0
62 240
63 0
64 -10
65 1
66 353792
67 0
68 -436480
69 0
70 89760
71 0
72 -7392
73 0
74 330
75 0
76 -11
77 1
78 0
79 4245504
80 0

List of values

[1, -1, 1, 0, -2, 1, 2, 0, -3, 1, 0, 8, 0, -4, 1, -16, 0, 20, 0, -5, 1, 0, -96, 0, 40, 0, -6, 1, 272, 0, -336, 0, 70, 0, -7, 1, 0, 2176, 0, -896, 0, 112, 0, -8, 1, -7936, 0, 9792, 0, -2016, 0, 168, 0, -9, 1, 0, -79360, 0, 32640, 0, -4032, 0, 240, 0, -10, 1, 353792, 0, -436480, 0, 89760, 0, -7392, 0, 330, 0, -11, 1, 0, 4245504, 0]