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.

A026931 Triangular array T read by rows: T(n,k) = number of partitions of n into an odd number of parts, each <= k.

Table of values

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

List of values

[1, 0, 1, 1, 1, 2, 0, 1, 1, 2, 1, 2, 3, 3, 4, 0, 2, 3, 4, 4, 5, 1, 2, 5, 6, 7, 7, 8, 0, 2, 4, 7, 8, 9, 9, 10, 1, 3, 7, 10, 13, 14, 15, 15, 16, 0, 3, 6, 11, 14, 17, 18, 19, 19, 20, 1, 3, 9, 14, 20, 23, 26, 27, 28, 28, 29, 0, 3, 8, 16, 22, 28, 31, 34, 35, 36]