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.

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

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 0
6 1
7 0
8 1
9 1
10 3
11 3
12 6
13 7
14 11
15 12
16 18
17 21
18 30
19 34
20 46
21 54
22 70
23 80
24 101
25 116
26 143
27 163
28 197
29 225
30 269
31 303
32 357
33 403
34 469
35 525
36 606
37 677
38 774
39 860
40 976
41 1082
42 1221
43 1346
44 1509
45 1661
46 1852
47 2029
48 2252
49 2462
50 2720
51 2964
52 3261

List of values

[0, 0, 0, 0, 0, 1, 0, 1, 1, 3, 3, 6, 7, 11, 12, 18, 21, 30, 34, 46, 54, 70, 80, 101, 116, 143, 163, 197, 225, 269, 303, 357, 403, 469, 525, 606, 677, 774, 860, 976, 1082, 1221, 1346, 1509, 1661, 1852, 2029, 2252, 2462, 2720, 2964, 3261]