This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A340718 #9 Jan 22 2021 14:17:55 %S A340718 0,1,3,5,7,9,11,15,17,19,21,23,27,31,33,35,37,39,43,45,47,51,55,63,65, %T A340718 67,69,71,73,75,77,79,83,85,87,91,93,95,99,103,107,111,119,127,129, %U A340718 131,133,135,137,139,141,143,147,149,151,153,155,157,159,163,165 %N A340718 a(n) is the least k such that A340717(k) = n. %C A340718 These are also the numbers k such that k <= A030101(k). %C A340718 All terms, except a(0) = 0, are odd. %C A340718 For any k > 0, there are A005418(k) terms with k+1 binary digits. %C A340718 A000225 and A006995 are subsequences. %H A340718 Rémy Sigrist, <a href="/A340718/b340718.txt">Table of n, a(n) for n = 0..8383</a> %e A340718 k | 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, ... %e A340718 A340717(k) | 0, 1, 1, 2, 1, 3, 2, 4, 1, 5, 3, 6, 2, 6, 4, 7, ... %e A340718 n | 0, 1, 2, 3, 4, 5, 6, 7, ... %e A340718 a(n) | 0, 1, 3, 5, 7, 9, 11, 15, ... %o A340718 (PARI) is(n) = n <= fromdigits(Vecrev(binary(n)), 2) %Y A340718 Cf. A000225, A005418, A006995, A030101, A340717. %K A340718 nonn,base %O A340718 0,3 %A A340718 _Rémy Sigrist_, Jan 17 2021