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.

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

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 1
6 1
7 2
8 2
9 3
10 4
11 6
12 7
13 10
14 11
15 14
16 16
17 20
18 23
19 28
20 31
21 37
22 41
23 48
24 53
25 61
26 67
27 76
28 83
29 94
30 102
31 114
32 123
33 136
34 147
35 162
36 174
37 191
38 204
39 222
40 237
41 257
42 274
43 296
44 314
45 338
46 358
47 384
48 406
49 434
50 458
51 488
52 514

List of values

[0, 0, 0, 0, 1, 1, 2, 2, 3, 4, 6, 7, 10, 11, 14, 16, 20, 23, 28, 31, 37, 41, 48, 53, 61, 67, 76, 83, 94, 102, 114, 123, 136, 147, 162, 174, 191, 204, 222, 237, 257, 274, 296, 314, 338, 358, 384, 406, 434, 458, 488, 514]