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.

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

Table of values

n a(n)
1 0
2 0
3 0
4 1
5 1
6 1
7 1
8 2
9 1
10 2
11 1
12 3
13 2
14 4
15 3
16 6
17 4
18 6
19 5
20 9
21 7
22 9
23 8
24 13
25 10
26 13
27 11
28 19
29 14
30 19
31 16
32 26
33 21
34 28
35 25
36 36
37 29
38 39
39 34
40 49
41 41
42 55
43 48
44 66
45 56
46 71
47 65
48 86
49 78
50 94
51 87
52 111
53 99
54 121
55 113
56 143
57 128
58 155
59 146
60 180
61 165
62 196
63 189
64 226
65 211
66 246
67 237
68 281
69 267
70 310
71 300
72 351
73 334

List of values

[0, 0, 0, 1, 1, 1, 1, 2, 1, 2, 1, 3, 2, 4, 3, 6, 4, 6, 5, 9, 7, 9, 8, 13, 10, 13, 11, 19, 14, 19, 16, 26, 21, 28, 25, 36, 29, 39, 34, 49, 41, 55, 48, 66, 56, 71, 65, 86, 78, 94, 87, 111, 99, 121, 113, 143, 128, 155, 146, 180, 165, 196, 189, 226, 211, 246, 237, 281, 267, 310, 300, 351, 334]