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.

A339242 Number of partitions of n into prime power parts (1 excluded) where every part appears at least 2 times.

Table of values

n a(n)
0 1
1 0
2 0
3 0
4 1
5 0
6 2
7 0
8 2
9 1
10 3
11 0
12 5
13 1
14 6
15 3
16 9
17 2
18 12
19 4
20 15
21 8
22 21
23 8
24 28
25 13
26 34
27 20
28 45
29 23
30 59
31 34
32 73
33 47
34 92
35 57
36 119
37 78
38 145
39 103
40 182
41 128
42 229
43 166
44 277
45 213
46 344
47 265
48 427
49 334
50 513
51 420
52 629
53 517
54 771
55 641
56 923
57 794
58 1120
59 967
60 1355
61 1182
62 1618
63 1447
64 1946
65 1745

List of values

[1, 0, 0, 0, 1, 0, 2, 0, 2, 1, 3, 0, 5, 1, 6, 3, 9, 2, 12, 4, 15, 8, 21, 8, 28, 13, 34, 20, 45, 23, 59, 34, 73, 47, 92, 57, 119, 78, 145, 103, 182, 128, 229, 166, 277, 213, 344, 265, 427, 334, 513, 420, 629, 517, 771, 641, 923, 794, 1120, 967, 1355, 1182, 1618, 1447, 1946, 1745]