reviewed
approved
reviewed
approved
proposed
reviewed
editing
proposed
a(n) exists for all n. Proof. Let b(i) be the binary representation of i. Let L be its length, and let 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 contains the '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)
proposed
editing
editing
proposed
a(5) <= 10718873460460617403023221866359404479. - Michael S. Branicky, Sep 21 2023
a(5) <= 10718873460460617403023221866359404479.
proposed
editing
editing
proposed
editing
proposed
a(n) exists for all n. Proof. Let b(ni) be the binary representation of ni. Let L be its length, and let w = 0^L be a string of L 0's. Then a(n+1) <= u = b(1)wb(2)w...wb(a(n)-1) since u contains the binary representation of each number less than a(n ) but not that of a(n). So, A261923(u) = 1 + A261923(a(n)). (End)
proposed
editing