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.

A276107 Number of partitions of n which can themselves be subdivided into two partitions whose sums differ by 1 at most.

Table of values

n a(n)
0 1
1 1
2 1
3 2
4 3
5 5
6 6
7 11
8 14
9 22
10 25
11 43
12 53
13 79
14 89
15 140
16 167
17 243
18 278
19 409
20 480
21 666
22 760
23 1082
24 1273
25 1708
26 1948
27 2649
28 3089
29 4073
30 4682
31 6180
32 7177
33 9213
34 10565
35 13660
36 15869
37 19987
38 22911
39 29012
40 33601
41 41762
42 47942
43 59571
44 68756
45 84240
46 96570
47 118641

List of values

[1, 1, 1, 2, 3, 5, 6, 11, 14, 22, 25, 43, 53, 79, 89, 140, 167, 243, 278, 409, 480, 666, 760, 1082, 1273, 1708, 1948, 2649, 3089, 4073, 4682, 6180, 7177, 9213, 10565, 13660, 15869, 19987, 22911, 29012, 33601, 41762, 47942, 59571, 68756, 84240, 96570, 118641]