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.

A350894 Number of partitions of n such that (smallest part) = 3*(number of parts).

Table of values

n a(n)
1 0
2 0
3 1
4 0
5 0
6 0
7 0
8 0
9 0
10 0
11 0
12 1
13 1
14 1
15 1
16 1
17 1
18 1
19 1
20 1
21 1
22 1
23 1
24 1
25 1
26 1
27 2
28 2
29 3
30 3
31 4
32 4
33 5
34 5
35 6
36 6
37 7
38 7
39 8
40 8
41 9
42 9
43 10
44 10
45 11
46 11
47 12
48 13
49 14
50 15
51 17
52 18
53 20
54 22
55 24
56 26
57 29
58 31
59 34
60 37
61 40
62 43
63 47
64 50
65 54
66 58
67 62
68 66
69 71
70 75
71 80
72 85
73 90
74 95
75 102
76 107
77 114
78 121
79 129
80 136
81 146
82 154
83 165
84 175
85 187
86 198
87 213

List of values

[0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 13, 14, 15, 17, 18, 20, 22, 24, 26, 29, 31, 34, 37, 40, 43, 47, 50, 54, 58, 62, 66, 71, 75, 80, 85, 90, 95, 102, 107, 114, 121, 129, 136, 146, 154, 165, 175, 187, 198, 213]