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.

A160974 Number of partitions of n where every part appears at least 4 times.

Table of values

n a(n)
0 1
1 0
2 0
3 0
4 1
5 1
6 1
7 1
8 2
9 1
10 2
11 1
12 4
13 2
14 4
15 4
16 7
17 5
18 8
19 7
20 13
21 10
22 13
23 12
24 21
25 18
26 22
27 21
28 34
29 29
30 40
31 36
32 55
33 48
34 63
35 64
36 88
37 79
38 100
39 99
40 139
41 125
42 160
43 155
44 207
45 199
46 241
47 241
48 314
49 302
50 369
51 366
52 466
53 454
54 550
55 557
56 690
57 679
58 807
59 821
60 1016
61 1001
62 1180
63 1207
64 1460
65 1466
66 1708

List of values

[1, 0, 0, 0, 1, 1, 1, 1, 2, 1, 2, 1, 4, 2, 4, 4, 7, 5, 8, 7, 13, 10, 13, 12, 21, 18, 22, 21, 34, 29, 40, 36, 55, 48, 63, 64, 88, 79, 100, 99, 139, 125, 160, 155, 207, 199, 241, 241, 314, 302, 369, 366, 466, 454, 550, 557, 690, 679, 807, 821, 1016, 1001, 1180, 1207, 1460, 1466, 1708]