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.

A089958 Number of partitions of n in which every part occurs 2, 3, or 5 times.

Table of values

n a(n)
0 1
1 0
2 1
3 1
4 1
5 1
6 3
7 1
8 3
9 4
10 4
11 4
12 8
13 5
14 9
15 11
16 11
17 12
18 20
19 15
20 23
21 27
22 28
23 31
24 45
25 38
26 52
27 61
28 64
29 71
30 96
31 87
32 112
33 129
34 136
35 151
36 194
37 184
38 227
39 259
40 275
41 304
42 376
43 368
44 441
45 499
46 531
47 586
48 704
49 705
50 826
51 927
52 989
53 1088
54 1280
55 1302
56 1500
57 1672
58 1787
59 1960
60 2267

List of values

[1, 0, 1, 1, 1, 1, 3, 1, 3, 4, 4, 4, 8, 5, 9, 11, 11, 12, 20, 15, 23, 27, 28, 31, 45, 38, 52, 61, 64, 71, 96, 87, 112, 129, 136, 151, 194, 184, 227, 259, 275, 304, 376, 368, 441, 499, 531, 586, 704, 705, 826, 927, 989, 1088, 1280, 1302, 1500, 1672, 1787, 1960, 2267]