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.

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

Table of values

n a(n)
1 0
2 0
3 1
4 1
5 1
6 2
7 1
8 2
9 2
10 3
11 3
12 5
13 4
14 5
15 6
16 8
17 7
18 9
19 9
20 12
21 12
22 14
23 14
24 19
25 18
26 22
27 23
28 28
29 27
30 32
31 34
32 40
33 42
34 47
35 48
36 57
37 58
38 66
39 69
40 78
41 81
42 89
43 94
44 106
45 111
46 120
47 128
48 143
49 148
50 161
51 170
52 187
53 196
54 214
55 225
56 244
57 257
58 277
59 294
60 319
61 335
62 357
63 377
64 409
65 428
66 460
67 483
68 519
69 546
70 582

List of values

[0, 0, 1, 1, 1, 2, 1, 2, 2, 3, 3, 5, 4, 5, 6, 8, 7, 9, 9, 12, 12, 14, 14, 19, 18, 22, 23, 28, 27, 32, 34, 40, 42, 47, 48, 57, 58, 66, 69, 78, 81, 89, 94, 106, 111, 120, 128, 143, 148, 161, 170, 187, 196, 214, 225, 244, 257, 277, 294, 319, 335, 357, 377, 409, 428, 460, 483, 519, 546, 582]