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.

A373068 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 1
4 1
5 1
6 1
7 1
8 1
9 1
10 1
11 1
12 2
13 2
14 3
15 3
16 4
17 4
18 5
19 5
20 6
21 6
22 7
23 7
24 8
25 8
26 9
27 10
28 11
29 12
30 14
31 15
32 17
33 19
34 21
35 23
36 26
37 28
38 31
39 34
40 37
41 40
42 44
43 47
44 51
45 55
46 59
47 63
48 69
49 73
50 79
51 85
52 92
53 98
54 107
55 114
56 124
57 133
58 144
59 154
60 168
61 179
62 194
63 208
64 225
65 240
66 260
67 277
68 299
69 319
70 343
71 365
72 393
73 417
74 447
75 476

List of values

[1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 10, 11, 12, 14, 15, 17, 19, 21, 23, 26, 28, 31, 34, 37, 40, 44, 47, 51, 55, 59, 63, 69, 73, 79, 85, 92, 98, 107, 114, 124, 133, 144, 154, 168, 179, 194, 208, 225, 240, 260, 277, 299, 319, 343, 365, 393, 417, 447, 476]