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.

A108871 Numbers n such that the number of digits required to write the prime factors of n is equal to the number of divisors of n.

Table of values

n a(n)
1 11
2 13
3 17
4 19
5 23
6 29
7 31
8 37
9 41
10 43
11 47
12 53
13 59
14 61
15 67
16 71
17 73
18 79
19 83
20 89
21 97
22 143
23 187
24 202
25 206
26 209
27 214
28 218
29 221
30 226
31 247
32 253
33 254
34 262
35 274
36 278
37 298
38 299
39 302
40 303
41 309
42 314
43 319
44 321
45 323
46 326
47 327
48 334
49 339
50 341
51 346
52 358
53 362
54 377
55 381
56 382
57 386

List of values

[11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 143, 187, 202, 206, 209, 214, 218, 221, 226, 247, 253, 254, 262, 274, 278, 298, 299, 302, 303, 309, 314, 319, 321, 323, 326, 327, 334, 339, 341, 346, 358, 362, 377, 381, 382, 386]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.