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.

A238543 Number of partitions p of n such that 3*min(p) + (number of parts of p) is not a part of p.

Table of values

n a(n)
1 1
2 2
3 3
4 5
5 7
6 10
7 15
8 21
9 29
10 39
11 54
12 73
13 96
14 126
15 167
16 217
17 281
18 359
19 461
20 587
21 744
22 935
23 1176
24 1470
25 1832
26 2271
27 2814
28 3465
29 4262
30 5219
31 6383
32 7777
33 9456
34 11458
35 13869
36 16733
37 20155
38 24208
39 29040
40 34743
41 41508
42 49473
43 58886
44 69944
45 82964
46 98208
47 116113

List of values

[1, 2, 3, 5, 7, 10, 15, 21, 29, 39, 54, 73, 96, 126, 167, 217, 281, 359, 461, 587, 744, 935, 1176, 1470, 1832, 2271, 2814, 3465, 4262, 5219, 6383, 7777, 9456, 11458, 13869, 16733, 20155, 24208, 29040, 34743, 41508, 49473, 58886, 69944, 82964, 98208, 116113]