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.

A326075 Difference between the number of prime divisors in a nonstandard factorization process based on the sieve of Eratosthenes vs. their number in the ordinary factorization of n (when counted with multiplicity): a(n) = A253557(n) - A001222(n).

Table of values

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

List of values

[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, -1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, -1, 1, 0, 1, 0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 2, 0, 0, 0, 0, 0, -1, 0, 0, 0, 0, 0, -1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 3, 0, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 1]