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.

A373074 Number of partitions of n such that (smallest part) > 3*(number of parts).

Table of values

n a(n)
0 1
1 0
2 0
3 0
4 1
5 1
6 1
7 1
8 1
9 1
10 1
11 1
12 1
13 1
14 2
15 2
16 3
17 3
18 4
19 4
20 5
21 5
22 6
23 6
24 7
25 7
26 8
27 8
28 9
29 9
30 11
31 11
32 13
33 14
34 16
35 17
36 20
37 21
38 24
39 26
40 29
41 31
42 35
43 37
44 41
45 44
46 48
47 51
48 56
49 59
50 64
51 68
52 74
53 78
54 85
55 90
56 98
57 104
58 113
59 120
60 131
61 139
62 151
63 161
64 175
65 186
66 202
67 215
68 233
69 248
70 268
71 285
72 308
73 327
74 352
75 374
76 402
77 426
78 457

List of values

[1, 0, 0, 0, 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, 11, 11, 13, 14, 16, 17, 20, 21, 24, 26, 29, 31, 35, 37, 41, 44, 48, 51, 56, 59, 64, 68, 74, 78, 85, 90, 98, 104, 113, 120, 131, 139, 151, 161, 175, 186, 202, 215, 233, 248, 268, 285, 308, 327, 352, 374, 402, 426, 457]