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.

A046660 Excess of n = number of prime divisors (with multiplicity) - number of prime divisors (without multiplicity).

Table of values

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

List of values

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