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 A238840 #27 Sep 05 2024 15:40:02 %S A238840 0,37,10077697,2821109907494 %N A238840 Smallest number m such that u + (sum of base-6 digits of u) = m has exactly n solutions. %C A238840 The next term is a(5) = 6^((6^9+6^2+8)/5) + 38 = 6^2015548 + 38 and is too large to display. %H A238840 Max Alekseyev, <a href="/A238840/a238840.txt">Table of expressions for a(n), for n=1..100</a> %H A238840 Max A. Alekseyev and N. J. A. Sloane, <a href="https://arxiv.org/abs/2112.14365">On Kaprekar's Junction Numbers</a>, arXiv:2112.14365, 2021; Journal of Combinatorics and Number Theory 12:3 (2022), 115-155. %Y A238840 Smallest number m such that u + (sum of base-b digits of u) = m has exactly n solutions, for bases 2 through 10: A230303, A230640, A230638, A230867, A238840, A238841, A238842, A238843, A006064. %K A238840 nonn,base %O A238840 1,2 %A A238840 _N. J. A. Sloane_, Mar 19 2014