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.

A238005 Number of partitions of n into distinct parts such that (greatest part) - (least part) = (number of parts).

Table of values

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

List of values

[0, 0, 0, 1, 0, 1, 1, 2, 0, 2, 2, 2, 2, 2, 1, 4, 3, 2, 3, 3, 2, 4, 4, 4, 3, 4, 2, 5, 5, 3, 5, 6, 3, 5, 3, 5, 6, 6, 4, 6, 6, 4, 6, 6, 3, 7, 7, 7, 6, 6, 5, 7, 7, 5, 6, 8, 6, 8, 8, 6, 8, 8, 4, 9, 6, 7, 9, 9, 7, 7, 9, 8, 9, 9, 5, 9, 7, 8, 10, 10]