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.

A161078 Number of partitions of n into primes or 1 where every part appears at least 3 times.

Table of values

n a(n)
1 0
2 0
3 1
4 1
5 1
6 2
7 1
8 2
9 3
10 3
11 3
12 6
13 5
14 6
15 10
16 8
17 9
18 14
19 13
20 16
21 21
22 19
23 23
24 30
25 31
26 34
27 42
28 44
29 49
30 60
31 61
32 68
33 83
34 85
35 96
36 111
37 115
38 129
39 149
40 158
41 173
42 196
43 210
44 229
45 260
46 275
47 301
48 339
49 359
50 392
51 436
52 462
53 505
54 559
55 594
56 645
57 708
58 755
59 817
60 895
61 952
62 1026
63 1123
64 1194
65 1287

List of values

[0, 0, 1, 1, 1, 2, 1, 2, 3, 3, 3, 6, 5, 6, 10, 8, 9, 14, 13, 16, 21, 19, 23, 30, 31, 34, 42, 44, 49, 60, 61, 68, 83, 85, 96, 111, 115, 129, 149, 158, 173, 196, 210, 229, 260, 275, 301, 339, 359, 392, 436, 462, 505, 559, 594, 645, 708, 755, 817, 895, 952, 1026, 1123, 1194, 1287]