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.

A339893 a(n) = A000523(n) - A001222(n); floor(log_2(n)) minus the number of prime divisors of n, counted with multiplicity.

Table of values

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

List of values

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