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.

A305802 Difference in number of prime factors (when counted with multiplicity) between GF(2)[X] (carryless binary) and ordinary factorization: a(n) = A091222(n) - A001222(n).

Table of values

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

List of values

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