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.

A070936 Square array read by antidiagonals: T(n,k) = number of partitions of n into distinct parts, each no more than k.

Table of values

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

List of values

[1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 2, 0, 0, 0, 1, 1, 1, 2, 1, 0, 0, 0, 1, 1, 1, 2, 2, 1, 0, 0, 0, 1, 1, 1, 2, 2, 2, 1, 0, 0, 0, 1, 1, 1, 2, 2, 3, 2, 0, 0, 0, 0, 1, 1, 1, 2, 2, 3, 3, 2, 0, 0, 0, 0, 1, 1, 1, 2, 2, 3, 4, 3, 1, 0, 0, 0, 0, 1, 1, 1, 2, 2, 3, 4, 4, 3, 1, 0, 0, 0, 0]