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.

A100405 Number of partitions of n where every part appears more than two times.

Table of values

n a(n)
0 1
1 0
2 0
3 1
4 1
5 1
6 2
7 1
8 2
9 3
10 3
11 3
12 7
13 5
14 6
15 11
16 10
17 10
18 17
19 15
20 20
21 26
22 25
23 29
24 44
25 41
26 47
27 63
28 67
29 72
30 99
31 97
32 114
33 143
34 148
35 168
36 216
37 216
38 248
39 306
40 328
41 358
42 443
43 462
44 527
45 629
46 665
47 739
48 898
49 936
50 1055
51 1238
52 1330
53 1465
54 1727
55 1837
56 2055
57 2366
58 2543
59 2808
60 3274

List of values

[1, 0, 0, 1, 1, 1, 2, 1, 2, 3, 3, 3, 7, 5, 6, 11, 10, 10, 17, 15, 20, 26, 25, 29, 44, 41, 47, 63, 67, 72, 99, 97, 114, 143, 148, 168, 216, 216, 248, 306, 328, 358, 443, 462, 527, 629, 665, 739, 898, 936, 1055, 1238, 1330, 1465, 1727, 1837, 2055, 2366, 2543, 2808, 3274]