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.
0, 2, 4, 6, 3, 10, 103, 9, 5, 18
Offset: 1
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.
Comments