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.

A241069 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 1
6 0
7 1
8 1
9 0
10 2
11 0
12 0
13 1
14 1
15 2
16 1
17 2
18 1
19 3
20 4
21 3
22 3
23 3
24 4
25 6
26 6
27 4
28 6
29 5
30 8
31 8
32 9
33 9
34 10
35 13
36 11
37 13
38 15
39 17
40 20
41 21
42 21
43 24
44 25
45 29
46 30
47 33
48 35
49 40
50 44
51 44
52 49
53 51
54 56
55 61
56 66
57 69
58 77
59 82
60 91
61 95
62 102
63 106
64 116
65 127
66 134
67 147
68 157
69 168
70 182

List of values

[0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 2, 0, 0, 1, 1, 2, 1, 2, 1, 3, 4, 3, 3, 3, 4, 6, 6, 4, 6, 5, 8, 8, 9, 9, 10, 13, 11, 13, 15, 17, 20, 21, 21, 24, 25, 29, 30, 33, 35, 40, 44, 44, 49, 51, 56, 61, 66, 69, 77, 82, 91, 95, 102, 106, 116, 127, 134, 147, 157, 168, 182]