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.

A373399 For any number m, let m* be the bi-infinite string obtained by repetition of the binary expansion of m; a(n) is the least k such that the binary expansion of n appears in k*.

Table of values

n a(n)
1 1
2 2
3 1
4 4
5 2
6 5
7 1
8 8
9 4
10 2
11 5
12 9
13 5
14 11
15 1
16 16
17 8
18 4
19 9
20 18
21 2
22 5
23 11
24 17
25 9
26 21
27 5
28 19
29 11
30 23
31 1
32 32
33 16
34 8
35 17
36 4
37 18
38 9
39 19
40 34
41 18
42 2
43 21
44 37
45 5
46 11
47 23
48 33
49 17
50 37
51 9
52 38
53 21
54 5
55 11
56 35
57 19
58 43
59 11
60 39
61 23
62 47
63 1
64 64
65 32
66 16
67 33
68 8
69 34
70 17
71 35
72 68
73 4

List of values

[1, 2, 1, 4, 2, 5, 1, 8, 4, 2, 5, 9, 5, 11, 1, 16, 8, 4, 9, 18, 2, 5, 11, 17, 9, 21, 5, 19, 11, 23, 1, 32, 16, 8, 17, 4, 18, 9, 19, 34, 18, 2, 21, 37, 5, 11, 23, 33, 17, 37, 9, 38, 21, 5, 11, 35, 19, 43, 11, 39, 23, 47, 1, 64, 32, 16, 33, 8, 34, 17, 35, 68, 4]