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.

A079413 Number of ways to write n as sum of powers p^e of distinct primes p 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 2
8 1
9 2
10 1
11 3
12 1
13 3
14 2
15 3
16 3
17 3
18 2
19 5
20 3
21 4
22 3
23 9
24 3
25 5
26 4
27 6
28 4
29 18
30 3
31 20
32 8
33 7
34 8
35 10
36 6
37 30
38 9
39 11
40 8
41 41
42 5
43 47
44 11
45 12
46 13
47 63
48 10
49 42
50 13
51 23
52 16
53 89
54 13
55 35
56 20
57 34
58 28
59 126
60 11
61 134
62 35
63 36
64 44
65 57
66 15
67 185
68 40
69 64
70 19
71 236
72 31
73 251
74 64
75 55
76 54
77 117
78 24
79 341

List of values

[0, 0, 0, 0, 1, 0, 2, 1, 2, 1, 3, 1, 3, 2, 3, 3, 3, 2, 5, 3, 4, 3, 9, 3, 5, 4, 6, 4, 18, 3, 20, 8, 7, 8, 10, 6, 30, 9, 11, 8, 41, 5, 47, 11, 12, 13, 63, 10, 42, 13, 23, 16, 89, 13, 35, 20, 34, 28, 126, 11, 134, 35, 36, 44, 57, 15, 185, 40, 64, 19, 236, 31, 251, 64, 55, 54, 117, 24, 341]