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.

A109600 Numbers n such that number of 1's in binary representation of n equals the number of digits required to write the prime factors of n.

Table of values

n a(n)
1 2
2 6
3 9
4 10
5 17
6 22
7 26
8 28
9 38
10 42
11 50
12 54
13 60
14 69
15 70
16 74
17 78
18 82
19 90
20 92
21 98
22 99
23 102
24 114
25 116
26 131
27 133
28 134
29 135
30 137
31 145
32 146
33 150
34 153
35 154
36 161
37 165
38 169
39 170
40 172
41 193
42 194
43 195
44 202
45 209
46 210
47 212
48 220
49 225
50 226
51 234
52 242
53 248
54 259
55 265
56 275
57 278
58 282

List of values

[2, 6, 9, 10, 17, 22, 26, 28, 38, 42, 50, 54, 60, 69, 70, 74, 78, 82, 90, 92, 98, 99, 102, 114, 116, 131, 133, 134, 135, 137, 145, 146, 150, 153, 154, 161, 165, 169, 170, 172, 193, 194, 195, 202, 209, 210, 212, 220, 225, 226, 234, 242, 248, 259, 265, 275, 278, 282]

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

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