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.

A026922 Number of partitions of n into an odd number of parts, the greatest being 2; also, a(n+3) = number of partitions of n+1 into an even number of parts, each <=2.

Table of values

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

List of values

[0, 1, 0, 1, 1, 2, 1, 2, 2, 3, 2, 3, 3, 4, 3, 4, 4, 5, 4, 5, 5, 6, 5, 6, 6, 7, 6, 7, 7, 8, 7, 8, 8, 9, 8, 9, 9, 10, 9, 10, 10, 11, 10, 11, 11, 12, 11, 12, 12, 13, 12, 13, 13, 14, 13, 14, 14, 15, 14, 15, 15, 16, 15, 16, 16, 17, 16, 17, 17, 18, 17, 18, 18, 19, 18, 19, 19, 20, 19, 20, 20, 21]