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.

A109608 Numbers n such that the number of digits required to write the prime factors of n equals the number of digits of n.

Table of values

n a(n)
1 2
2 3
3 5
4 7
5 10
6 11
7 13
8 14
9 15
10 17
11 19
12 21
13 23
14 25
15 29
16 31
17 35
18 37
19 41
20 43
21 47
22 49
23 53
24 59
25 61
26 67
27 71
28 73
29 79
30 83
31 89
32 97
33 101
34 103
35 105
36 106
37 107
38 109
39 111
40 113
41 115
42 118
43 119
44 122
45 123
46 125
47 127
48 129
49 131
50 133
51 134
52 137
53 139
54 141
55 142
56 145
57 146
58 147
59 149
60 151
61 155

List of values

[2, 3, 5, 7, 10, 11, 13, 14, 15, 17, 19, 21, 23, 25, 29, 31, 35, 37, 41, 43, 47, 49, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 105, 106, 107, 109, 111, 113, 115, 118, 119, 122, 123, 125, 127, 129, 131, 133, 134, 137, 139, 141, 142, 145, 146, 147, 149, 151, 155]