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.

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

List of values

[0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 2, 1, 0, 1, 3, 2, 1, 1, 3, 2, 2, 3, 4, 3, 3, 5, 4, 5, 5, 7, 7, 7, 7, 7, 9, 10, 10, 11, 13, 14, 14, 14, 15, 17, 19, 22, 24, 23, 24, 28, 28, 31, 32, 36, 39, 42, 43, 46, 49, 53, 56, 59, 65, 68, 73, 77, 81, 87, 92]