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.

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

Table of values

n a(n)
1 0
2 1
3 1
4 2
5 1
6 4
7 2
8 5
9 5
10 8
11 6
12 12
13 10
14 16
15 16
16 22
17 21
18 31
19 30
20 40
21 42
22 53
23 55
24 71
25 73
26 90
27 96
28 116
29 123
30 149
31 157
32 186
33 200
34 234
35 250
36 292
37 312
38 360
39 388
40 443
41 476
42 543
43 584
44 660
45 712
46 800
47 862
48 967
49 1041
50 1160
51 1252
52 1390
53 1497
54 1659
55 1786
56 1970
57 2124
58 2336
59 2513
60 2760

List of values

[0, 1, 1, 2, 1, 4, 2, 5, 5, 8, 6, 12, 10, 16, 16, 22, 21, 31, 30, 40, 42, 53, 55, 71, 73, 90, 96, 116, 123, 149, 157, 186, 200, 234, 250, 292, 312, 360, 388, 443, 476, 543, 584, 660, 712, 800, 862, 967, 1041, 1160, 1252, 1390, 1497, 1659, 1786, 1970, 2124, 2336, 2513, 2760]