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.

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

Table of values

n a(n)
1 0
2 0
3 1
4 0
5 1
6 1
7 3
8 2
9 4
10 3
11 6
12 5
13 8
14 7
15 11
16 9
17 13
18 12
19 17
20 15
21 20
22 18
23 24
24 22
25 28
26 26
27 33
28 30
29 37
30 35
31 43
32 40
33 48
34 45
35 54
36 51
37 60
38 57
39 67
40 63
41 73
42 70
43 81
44 77
45 88
46 84
47 96
48 92
49 104
50 100
51 113
52 108
53 121
54 117
55 131

List of values

[0, 0, 1, 0, 1, 1, 3, 2, 4, 3, 6, 5, 8, 7, 11, 9, 13, 12, 17, 15, 20, 18, 24, 22, 28, 26, 33, 30, 37, 35, 43, 40, 48, 45, 54, 51, 60, 57, 67, 63, 73, 70, 81, 77, 88, 84, 96, 92, 104, 100, 113, 108, 121, 117, 131]