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.

A240872 Number of partitions p of n into distinct parts such that max(p) = 4 + min(p).

Table of values

n a(n)
0 0
1 0
2 0
3 0
4 0
5 0
6 1
7 0
8 2
9 1
10 2
11 2
12 3
13 2
14 2
15 3
16 3
17 2
18 2
19 2
20 4
21 2
22 2
23 2
24 3
25 3
26 2
27 2
28 3
29 2
30 3
31 2
32 3
33 2
34 2
35 3
36 3
37 2
38 2
39 2
40 4
41 2
42 2
43 2
44 3
45 3
46 2
47 2
48 3
49 2
50 3
51 2
52 3
53 2
54 2
55 3
56 3
57 2
58 2
59 2
60 4
61 2
62 2
63 2
64 3
65 3
66 2
67 2
68 3
69 2
70 3
71 2
72 3
73 2
74 2
75 3
76 3
77 2
78 2
79 2
80 4
81 2
82 2
83 2
84 3
85 3
86 2
87 2
88 3
89 2
90 3
91 2
92 3
93 2
94 2
95 3
96 3
97 2
98 2
99 2
100 4

List of values

[0, 0, 0, 0, 0, 0, 1, 0, 2, 1, 2, 2, 3, 2, 2, 3, 3, 2, 2, 2, 4, 2, 2, 2, 3, 3, 2, 2, 3, 2, 3, 2, 3, 2, 2, 3, 3, 2, 2, 2, 4, 2, 2, 2, 3, 3, 2, 2, 3, 2, 3, 2, 3, 2, 2, 3, 3, 2, 2, 2, 4, 2, 2, 2, 3, 3, 2, 2, 3, 2, 3, 2, 3, 2, 2, 3, 3, 2, 2, 2, 4, 2, 2, 2, 3, 3, 2, 2, 3, 2, 3, 2, 3, 2, 2, 3, 3, 2, 2, 2, 4]