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.

A238542 Number of partitions p of n such that 2*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 6
6 11
7 14
8 20
9 28
10 40
11 50
12 72
13 93
14 124
15 161
16 213
17 270
18 355
19 447
20 573
21 723
22 919
23 1142
24 1441
25 1786
26 2225
27 2745
28 3398
29 4160
30 5121
31 6240
32 7623
33 9255
34 11246
35 13577
36 16423
37 19753
38 23767
39 28478
40 34125
41 40723
42 48614
43 57815
44 68740
45 81496
46 96568
47 114103

List of values

[1, 2, 3, 5, 6, 11, 14, 20, 28, 40, 50, 72, 93, 124, 161, 213, 270, 355, 447, 573, 723, 919, 1142, 1441, 1786, 2225, 2745, 3398, 4160, 5121, 6240, 7623, 9255, 11246, 13577, 16423, 19753, 23767, 28478, 34125, 40723, 48614, 57815, 68740, 81496, 96568, 114103]