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 A329492 #8 Nov 17 2019 01:30:23 %S A329492 0,2,4,6,3,10,103,9,5,18 %N A329492 a(n) = smallest d such that the sum of digits of 2^d - n is equal to d, or -1 if no such d exists. %C A329492 The first open case is 11. Is a(11) = -1? See A329493. %C A329492 If a(i) = m > 0 then A328882 takes the value -i for the first time at term 2^m-i. For example, the first appearance of -7 in A328882 is at term 2^103 - 7. %Y A329492 Cf. A328882, A329002, A329493. %K A329492 nonn,base,more %O A329492 1,2 %A A329492 _N. J. A. Sloane_, Nov 16 2019