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.

A233249 a(1)=0; for k >= 1, let prime(k) map to 10...0 with k-1 zeros and let prime(k)*prime(m) map to the concatenation in binary of 2^(k-1) and 2^(m-1). For n >= 2, let the prime power factorization of n be mapped to r(n). a(n) is the term in A114994 which is c-equivalent to r(n) (see there our comment).

Table of values

n a(n)
1 0
2 1
3 2
4 3
5 4
6 5
7 8
8 7
9 10
10 9
11 16
12 11
13 32
14 17
15 18
16 15
17 64
18 21
19 128
20 19
21 34
22 33
23 256
24 23
25 36
26 65
27 42
28 35
29 512
30 37
31 1024
32 31
33 66
34 129
35 68
36 43
37 2048
38 257
39 130
40 39
41 4096
42 69
43 8192
44 67
45 74
46 513
47 16384
48 47
49 136
50 73
51 258
52 131
53 32768
54 85
55 132
56 71
57 514
58 1025
59 65536
60 75

List of values

[0, 1, 2, 3, 4, 5, 8, 7, 10, 9, 16, 11, 32, 17, 18, 15, 64, 21, 128, 19, 34, 33, 256, 23, 36, 65, 42, 35, 512, 37, 1024, 31, 66, 129, 68, 43, 2048, 257, 130, 39, 4096, 69, 8192, 67, 74, 513, 16384, 47, 136, 73, 258, 131, 32768, 85, 132, 71, 514, 1025, 65536, 75]