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.

A160975 Number of partitions of n where every part appears at least 5 times.

Table of values

n a(n)
0 1
1 0
2 0
3 0
4 0
5 1
6 1
7 1
8 1
9 1
10 2
11 1
12 2
13 1
14 2
15 3
16 3
17 3
18 5
19 4
20 7
21 7
22 7
23 8
24 11
25 12
26 12
27 14
28 15
29 16
30 23
31 20
32 24
33 26
34 29
35 36
36 40
37 40
38 46
39 50
40 63
41 63
42 76
43 76
44 87
45 103
46 108
47 117
48 135
49 140
50 167
51 173
52 191
53 205
54 235
55 257
56 278
57 300
58 327
59 354
60 413
61 424
62 469
63 511
64 555
65 616
66 673
67 711
68 783
69 849
70 947

List of values

[1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 3, 3, 3, 5, 4, 7, 7, 7, 8, 11, 12, 12, 14, 15, 16, 23, 20, 24, 26, 29, 36, 40, 40, 46, 50, 63, 63, 76, 76, 87, 103, 108, 117, 135, 140, 167, 173, 191, 205, 235, 257, 278, 300, 327, 354, 413, 424, 469, 511, 555, 616, 673, 711, 783, 849, 947]