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.

A268533 Pascal's difference pyramid read first by blocks and then by rows: T(n,k,m) = 1/(m!) * (d/dx)^m((1-x)^k*(1+x)^(n-k))|_{x=0}.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 -1
5 1
6 2
7 1
8 1
9 0
10 -1
11 1
12 -2
13 1
14 1
15 3
16 3
17 1
18 1
19 1
20 -1
21 -1
22 1
23 -1
24 -1
25 1
26 1
27 -3
28 3
29 -1
30 1
31 4
32 6
33 4
34 1
35 1
36 2
37 0
38 -2
39 -1
40 1
41 0
42 -2
43 0
44 1
45 1
46 -2
47 0
48 2
49 -1
50 1
51 -4
52 6
53 -4
54 1
55 1
56 5
57 10
58 10
59 5
60 1
61 1
62 3
63 2
64 -2
65 -3
66 -1
67 1
68 1
69 -2
70 -2
71 1
72 1
73 1
74 -1
75 -2
76 2
77 1
78 -1
79 1
80 -3
81 2
82 2
83 -3
84 1
85 1
86 -5
87 10
88 -10
89 5
90 -1

List of values

[1, 1, 1, 1, -1, 1, 2, 1, 1, 0, -1, 1, -2, 1, 1, 3, 3, 1, 1, 1, -1, -1, 1, -1, -1, 1, 1, -3, 3, -1, 1, 4, 6, 4, 1, 1, 2, 0, -2, -1, 1, 0, -2, 0, 1, 1, -2, 0, 2, -1, 1, -4, 6, -4, 1, 1, 5, 10, 10, 5, 1, 1, 3, 2, -2, -3, -1, 1, 1, -2, -2, 1, 1, 1, -1, -2, 2, 1, -1, 1, -3, 2, 2, -3, 1, 1, -5, 10, -10, 5, -1]