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.

A048985 Working in base 2, replace n with the concatenation of its prime divisors in increasing order (write answer in base 10).

Table of values

n a(n)
1 1
2 2
3 3
4 10
5 5
6 11
7 7
8 42
9 15
10 21
11 11
12 43
13 13
14 23
15 29
16 170
17 17
18 47
19 19
20 85
21 31
22 43
23 23
24 171
25 45
26 45
27 63
28 87
29 29
30 93
31 31
32 682
33 59
34 81
35 47
36 175
37 37
38 83
39 61
40 341
41 41
42 95
43 43
44 171
45 125
46 87
47 47
48 683
49 63
50 173
51 113
52 173
53 53
54 191
55 91
56 343
57 115
58 93
59 59
60 349
61 61
62 95
63 127
64 2730

List of values

[1, 2, 3, 10, 5, 11, 7, 42, 15, 21, 11, 43, 13, 23, 29, 170, 17, 47, 19, 85, 31, 43, 23, 171, 45, 45, 63, 87, 29, 93, 31, 682, 59, 81, 47, 175, 37, 83, 61, 341, 41, 95, 43, 171, 125, 87, 47, 683, 63, 173, 113, 173, 53, 191, 91, 343, 115, 93, 59, 349, 61, 95, 127, 2730]