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.

A238480 Number of partitions p of n that include (min(p) + max(p))/2 as a part.

Table of values

n a(n)
1 1
2 2
3 2
4 3
5 2
6 5
7 3
8 6
9 8
10 9
11 10
12 20
13 18
14 25
15 38
16 43
17 53
18 77
19 87
20 114
21 150
22 176
23 220
24 290
25 343
26 422
27 535
28 641
29 783
30 978
31 1164
32 1415
33 1733
34 2068
35 2497
36 3026
37 3595
38 4304
39 5174
40 6140
41 7300
42 8709
43 10283
44 12176
45 14435
46 16978
47 20001
48 23579
49 27640
50 32423
51 38024

List of values

[1, 2, 2, 3, 2, 5, 3, 6, 8, 9, 10, 20, 18, 25, 38, 43, 53, 77, 87, 114, 150, 176, 220, 290, 343, 422, 535, 641, 783, 978, 1164, 1415, 1733, 2068, 2497, 3026, 3595, 4304, 5174, 6140, 7300, 8709, 10283, 12176, 14435, 16978, 20001, 23579, 27640, 32423, 38024]