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.

A076649 Number of digits required to write the prime factors of n.

Table of values

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

List of values

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