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.

A226460 Let m! have prime factorization Product (p_j^e_j); a(n) = number of distinct prime factors p_j such that e_j = n has no solution for any m!.

Table of values

n a(n)
0 0
1 0
2 1
3 1
4 0
5 2
6 1
7 2
8 0
9 1
10 0
11 3
12 2
13 2
14 1
15 1
16 1
17 3
18 0
19 1
20 2
21 1
22 0
23 4
24 2
25 1
26 0
27 2
28 1
29 4
30 2
31 2
32 0
33 2
34 0
35 2
36 2
37 3
38 1
39 3
40 1
41 2
42 1
43 3
44 1
45 1
46 0
47 5
48 2
49 0
50 0
51 2
52 2
53 2
54 1
55 3
56 2
57 0
58 1
59 5
60 3
61 3
62 1
63 1
64 2
65 2
66 0
67 2
68 1
69 3
70 0
71 4
72 2
73 3
74 0
75 2
76 1
77 2
78 1
79 4
80 2
81 0
82 0
83 6
84 1
85 1
86 0

List of values

[0, 0, 1, 1, 0, 2, 1, 2, 0, 1, 0, 3, 2, 2, 1, 1, 1, 3, 0, 1, 2, 1, 0, 4, 2, 1, 0, 2, 1, 4, 2, 2, 0, 2, 0, 2, 2, 3, 1, 3, 1, 2, 1, 3, 1, 1, 0, 5, 2, 0, 0, 2, 2, 2, 1, 3, 2, 0, 1, 5, 3, 3, 1, 1, 2, 2, 0, 2, 1, 3, 0, 4, 2, 3, 0, 2, 1, 2, 1, 4, 2, 0, 0, 6, 1, 1, 0]