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.

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

Table of values

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

List of values

[0, 0, 0, 0, 0, 1, 0, 2, 1, 1, 2, 2, 0, 2, 2, 1, 1, 2, 1, 2, 1, 1, 2, 2, 0, 2, 2, 1, 1, 2, 1, 2, 1, 1, 2, 2, 0, 2, 2, 1, 1, 2, 1, 2, 1, 1, 2, 2, 0, 2, 2, 1, 1, 2, 1, 2, 1, 1, 2, 2, 0, 2, 2, 1, 1, 2, 1, 2, 1, 1, 2, 2, 0, 2, 2, 1, 1, 2, 1, 2, 1, 1, 2, 2, 0, 2, 2, 1, 1, 2, 1, 2, 1, 1, 2, 2, 0, 2, 2, 1, 1, 2, 1, 2, 1, 1, 2, 2, 0]