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.

A238594 Number of partitions p of n such that 2*min(p) is not a part of p.

Table of values

n a(n)
1 1
2 2
3 2
4 4
5 5
6 7
7 10
8 14
9 17
10 25
11 32
12 41
13 54
14 71
15 88
16 115
17 144
18 182
19 229
20 287
21 353
22 443
23 545
24 670
25 822
26 1009
27 1224
28 1495
29 1809
30 2189
31 2641
32 3182
33 3813
34 4580
35 5470
36 6528
37 7773
38 9248
39 10960
40 12994
41 15355
42 18129
43 21363
44 25146
45 29525
46 34659
47 40589
48 47488
49 55473

List of values

[1, 2, 2, 4, 5, 7, 10, 14, 17, 25, 32, 41, 54, 71, 88, 115, 144, 182, 229, 287, 353, 443, 545, 670, 822, 1009, 1224, 1495, 1809, 2189, 2641, 3182, 3813, 4580, 5470, 6528, 7773, 9248, 10960, 12994, 15355, 18129, 21363, 25146, 29525, 34659, 40589, 47488, 55473]