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.

A079412 Number of ways to write n as sum of prime powers p^e such that e>0 and p does not divide n.

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 1
6 0
7 3
8 1
9 3
10 1
11 11
12 1
13 18
14 3
15 7
16 5
17 43
18 2
19 65
20 5
21 24
22 10
23 137
24 4
25 115
26 17
27 84
28 16
29 379
30 3
31 519
32 42
33 152
34 47
35 317
36 12
37 1267
38 73
39 334
40 41
41 2213
42 9
43 2897
44 107
45 344
46 174
47 4871
48 32
49 3733
50 100
51 1369
52 245
53 10218
54 51
55 4037
56 235
57 2607
58 554
59 20586
60 23
61 25792
62 795

List of values

[0, 0, 0, 0, 1, 0, 3, 1, 3, 1, 11, 1, 18, 3, 7, 5, 43, 2, 65, 5, 24, 10, 137, 4, 115, 17, 84, 16, 379, 3, 519, 42, 152, 47, 317, 12, 1267, 73, 334, 41, 2213, 9, 2897, 107, 344, 174, 4871, 32, 3733, 100, 1369, 245, 10218, 51, 4037, 235, 2607, 554, 20586, 23, 25792, 795]