|
|
A319103
|
|
a(n) is the least k > 0 such that A318928(k) = n.
|
|
4
|
|
|
1, 3, 2, 4, 11, 18, 75, 621, 9638, 1264052, 1294752365, 20699153586797, 43409394810283725529
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
This sequence is well defined and infinite:
- for any n > 1, we can build a number m such that A318928(m) = 1 + A318928(n),
- let (b_1, ..., b_k) be the binary representation of n,
- let r_1 = 1, and for i = 1..k-1: r_{i+1} = r_i if b_{i+1} = b_i and r_{i+1} = 2 - r_i otherwise,
- the number m whose run lengths in binary representation are (r_1, ..., r_k) satisfies A318928(m) = 1 + A318928(n).
a(11) <= 42414573279593.
|
|
LINKS
|
|
|
EXAMPLE
|
The first terms of A318928, alongside the corresponding terms in this sequence, are:
-- ---------- -------------------
1 0 a(0) = 1
2 2 a(2) = 2
3 1 a(1) = 3
4 3 a(3) = 4
5 2
6 3
7 1
8 3
9 3
10 2
11 4 a(4) = 11
12 2
13 4
|
|
PROG
|
(PARI) See Links section.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|