|
|
A261396
|
|
a(n) = smallest k such that A260273(k) >= 2^n.
|
|
6
|
|
|
1, 2, 3, 4, 7, 12, 19, 34, 61, 110, 200, 371, 697, 1310, 2484, 4739, 9072, 17458, 33671, 65128, 126225, 244802, 475124, 922891, 1793461, 3487348, 6784691, 13208038, 25731600, 50166771, 97873783, 191089176, 373349780, 729972649, 1428257200, 2796453078, 5478981032, 10741710906, 21072415837
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
The sequence indicates the first time a term in A260273 has binary length n+1.
|
|
LINKS
|
|
|
PROG
|
(Haskell)
a261396 n = a261396_list !! (n-1)
a261396_list = f 1 1 a260273_list where
f z k (x:xs) | x >= z = k : f (2 * z) (k + 1) xs
| otherwise = f z (k + 1) xs
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|