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 A238841 #25 Sep 05 2024 15:40:47 %S A238841 0,8,50,352,282475258,232630513987258, %T A238841 418377847259091645147530834859099334519176045887014771594 %N A238841 Smallest number m such that u + (sum of base-7 digits of u) = m has exactly n solutions. %H A238841 Max Alekseyev, <a href="/A238841/a238841.txt">Table of expressions for a(n), for n=1..100</a> %H A238841 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 A238841 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 A238841 nonn,base %O A238841 1,2 %A A238841 _N. J. A. Sloane_, Mar 19 2014