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.

A276935 Number of distinct prime factors prime(k) of n such that prime(k)^k, but not prime(k)^(k+1) is a divisor of n.

Table of values

n a(n)
1 0
2 1
3 0
4 0
5 0
6 1
7 0
8 0
9 1
10 1
11 0
12 0
13 0
14 1
15 0
16 0
17 0
18 2
19 0
20 0
21 0
22 1
23 0
24 0
25 0
26 1
27 0
28 0
29 0
30 1
31 0
32 0
33 0
34 1
35 0
36 1
37 0
38 1
39 0
40 0
41 0
42 1
43 0
44 0
45 1
46 1
47 0
48 0
49 0
50 1
51 0
52 0
53 0
54 1
55 0
56 0
57 0
58 1
59 0
60 0
61 0
62 1
63 1
64 0
65 0
66 1
67 0
68 0
69 0
70 1
71 0
72 1
73 0
74 1
75 0
76 0
77 0
78 1
79 0
80 0
81 0
82 1
83 0
84 0
85 0
86 1
87 0
88 0
89 0
90 2
91 0
92 0
93 0
94 1
95 0
96 0
97 0
98 1
99 1
100 0
101 0
102 1
103 0
104 0
105 0
106 1
107 0
108 0
109 0
110 1
111 0
112 0
113 0
114 1
115 0
116 0
117 1
118 1
119 0
120 0

List of values

[0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 2, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 2, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0]