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.

A160990 Number of partitions of n where every part appears at least 20 times.

Table of values

n a(n)
0 1
1 0
2 0
3 0
4 0
5 0
6 0
7 0
8 0
9 0
10 0
11 0
12 0
13 0
14 0
15 0
16 0
17 0
18 0
19 0
20 1
21 1
22 1
23 1
24 1
25 1
26 1
27 1
28 1
29 1
30 1
31 1
32 1
33 1
34 1
35 1
36 1
37 1
38 1
39 1
40 2
41 1
42 2
43 1
44 2
45 1
46 2
47 1
48 2
49 1
50 2
51 1
52 2
53 1
54 2
55 1
56 2
57 1
58 2
59 1
60 4
61 2
62 4
63 4
64 5
65 4
66 7
67 5
68 7
69 7
70 8
71 7
72 10
73 8
74 10
75 10
76 11
77 10
78 13
79 11
80 15
81 14
82 15
83 15
84 19
85 16
86 19
87 19
88 21
89 20
90 23
91 21
92 25
93 24
94 25
95 25
96 29
97 26
98 29
99 29
100 34
101 31
102 35
103 33
104 38
105 38
106 39
107 38
108 44

List of values

[1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 4, 2, 4, 4, 5, 4, 7, 5, 7, 7, 8, 7, 10, 8, 10, 10, 11, 10, 13, 11, 15, 14, 15, 15, 19, 16, 19, 19, 21, 20, 23, 21, 25, 24, 25, 25, 29, 26, 29, 29, 34, 31, 35, 33, 38, 38, 39, 38, 44]