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.

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

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 0
6 0
7 1
8 1
9 2
10 2
11 4
12 5
13 7
14 9
15 14
16 17
17 23
18 28
19 37
20 44
21 56
22 66
23 83
24 98
25 119
26 139
27 168
28 194
29 229
30 263
31 309
32 352
33 408
34 462
35 532
36 600
37 683
38 766
39 869
40 969
41 1090
42 1211
43 1356
44 1500
45 1670
46 1840
47 2041
48 2242
49 2473
50 2707
51 2978
52 3249

List of values

[0, 0, 0, 0, 0, 0, 1, 1, 2, 2, 4, 5, 7, 9, 14, 17, 23, 28, 37, 44, 56, 66, 83, 98, 119, 139, 168, 194, 229, 263, 309, 352, 408, 462, 532, 600, 683, 766, 869, 969, 1090, 1211, 1356, 1500, 1670, 1840, 2041, 2242, 2473, 2707, 2978, 3249]