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.

A045835 Numbers n such that sopfr(Omega(n)) = Omega(sopfr(n)), where Omega(m) is the number and sopfr(m) is the sum of prime factors of m, with repetition respectively.

Table of values

n a(n)
1 1
2 4
3 9
4 14
5 18
6 21
7 25
8 26
9 33
10 38
11 42
12 46
13 49
14 50
15 57
16 62
17 69
18 74
19 78
20 85
21 92
22 93
23 94
24 106
25 110
26 121
27 129
28 130
29 133
30 134
31 138
32 140
33 145
34 154
35 164
36 166
37 169
38 177
39 178
40 189
41 204
42 205
43 213
44 217
45 218
46 222
47 225
48 226
49 230
50 236
51 237
52 249
53 253
54 254
55 262
56 265
57 266
58 278

List of values

[1, 4, 9, 14, 18, 21, 25, 26, 33, 38, 42, 46, 49, 50, 57, 62, 69, 74, 78, 85, 92, 93, 94, 106, 110, 121, 129, 130, 133, 134, 138, 140, 145, 154, 164, 166, 169, 177, 178, 189, 204, 205, 213, 217, 218, 222, 225, 226, 230, 236, 237, 249, 253, 254, 262, 265, 266, 278]

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

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