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.

A161255 Number of partitions of n into central polygonal numbers A000124 where every part appears at least 2 times.

Table of values

n a(n)
1 0
2 1
3 1
4 2
5 1
6 3
7 2
8 5
9 3
10 6
11 5
12 9
13 6
14 12
15 9
16 16
17 12
18 20
19 16
20 26
21 21
22 33
23 27
24 41
25 35
26 50
27 43
28 62
29 54
30 75
31 66
32 91
33 82
34 108
35 99
36 131
37 120
38 154
39 144
40 183
41 172
42 214
43 204
44 254
45 240
46 294
47 284
48 344
49 331
50 398
51 387
52 462
53 449
54 531
55 521
56 612
57 600
58 702
59 690
60 803
61 792
62 915
63 905
64 1043

List of values

[0, 1, 1, 2, 1, 3, 2, 5, 3, 6, 5, 9, 6, 12, 9, 16, 12, 20, 16, 26, 21, 33, 27, 41, 35, 50, 43, 62, 54, 75, 66, 91, 82, 108, 99, 131, 120, 154, 144, 183, 172, 214, 204, 254, 240, 294, 284, 344, 331, 398, 387, 462, 449, 531, 521, 612, 600, 702, 690, 803, 792, 915, 905, 1043]