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.

A206922 Root of the n-th binary palindrome. Least number r > 1 such that A006995(n) can be represented by a finite or infinite number of iterations A006995(A006995(A006995(...(...(r))...).

Table of values

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

List of values

[2, 2, 3, 4, 4, 6, 4, 8, 6, 10, 11, 12, 13, 14, 4, 16, 8, 18, 19, 20, 6, 22, 23, 24, 25, 26, 10, 28, 29, 30, 11, 32, 12, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 13, 46, 47, 48, 49, 50, 14, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 4, 64, 16, 66, 67, 68]