|
|
A262279
|
|
Smallest m such that A261923(m) = n.
|
|
3
|
|
|
|
OFFSET
|
0,3
|
|
COMMENTS
|
a(5) <= 10718873460460617403023221866359404479.
a(n) exists for all n. Proof. Let b(i) be the binary representation of i. Let L be its length, and w = 0^L be a string of L 0's. Then a(n+1) <= u = b(1)wb(2)w...wb(a(n)-1)_2 since u's binary representation contains that of each number less than a(n) but not that of a(n). So, A261923(u) = 1 + A261923(a(n)). (End)
|
|
LINKS
|
|
|
PROG
|
(Haskell)
import Data.List (elemIndex); import Data.Maybe (fromJust)
a262279 = fromJust . (`elemIndex` a261923_list)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|