|
|
A336717
|
|
a(n) is the least k such that R(k) = n for some random Fibonacci sequence R (a random Fibonacci sequence R satisfies R(0) = 0, R(1) = 1, and for m > 0, R(m+1) = R(m) + (-1)^r(m) * R(m-1) where r is a sequence of integers).
|
|
2
|
|
|
0, 1, 3, 4, 6, 5, 9, 7, 6, 8, 9, 8, 9, 7, 9, 10, 9, 10, 9, 10, 12, 8, 12, 10, 12, 10, 12, 11, 12, 10, 12, 11, 12, 13, 9, 13, 12, 11, 15, 11, 12, 11, 15, 13, 12, 13, 12, 11, 15, 13, 12, 13, 15, 13, 15, 10, 15, 13, 15, 13, 12, 14, 15, 14, 12, 13, 12, 14, 15, 14
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
COMMENTS
|
This sequence is well defined as the random Fibonacci sequence A092942 contains every nonnegative integers.
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
For n = 4:
- random Fibonacci sequences R may start as follows:
R(0) R(1) R(2) R(3) R(4) R(5) R(6)
---- ---- ---- ---- ---- ---- ----
0 1 1 2 3 5 8
0 1 1 2 3 5 2
0 1 1 2 3 1 4
0 1 1 2 3 1 -2
0 1 1 2 1 3 4
0 1 1 2 1 3 2
0 1 1 2 1 -1 0
0 1 1 2 1 -1 -2
0 1 1 0 1 1 2
0 1 1 0 1 1 0
0 1 1 0 -1 -1 0
0 1 1 0 -1 -1 -2
- the value 4 first appears in column R(6),
- so a(4) = 6.
|
|
PROG
|
(C) See Links section.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|