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.

A160978 Number of partitions of n where every part appears at least 8 times.

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 0
6 0
7 0
8 1
9 1
10 1
11 1
12 1
13 1
14 1
15 1
16 2
17 1
18 2
19 1
20 2
21 1
22 2
23 1
24 4
25 2
26 4
27 4
28 5
29 4
30 7
31 5
32 9
33 8
34 9
35 9
36 13
37 10
38 13
39 13
40 18
41 15
42 19
43 17
44 22
45 22
46 23
47 22
48 32
49 27
50 33
51 32
52 39
53 37
54 46
55 43
56 57
57 52
58 62
59 60
60 78
61 70
62 84
63 85
64 105
65 99
66 118
67 113
68 138
69 134
70 157
71 153
72 191
73 178
74 208
75 208
76 241
77 234
78 274
79 266
80 321
81 312

List of values

[0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 4, 2, 4, 4, 5, 4, 7, 5, 9, 8, 9, 9, 13, 10, 13, 13, 18, 15, 19, 17, 22, 22, 23, 22, 32, 27, 33, 32, 39, 37, 46, 43, 57, 52, 62, 60, 78, 70, 84, 85, 105, 99, 118, 113, 138, 134, 157, 153, 191, 178, 208, 208, 241, 234, 274, 266, 321, 312]