|
%I #22 Sep 04 2022 14:50:54
%S 0,10,82,740,282429536492,109418989131512359292,
%T 193632597890512706847971583764083347958511186984324587565465147107798425867049291402906445603076812
%N Smallest number m such that u + (sum of base-9 digits of u) = m has exactly n solutions.
%H Max Alekseyev, <a href="/A238843/a238843.txt">Table of expressions for a(n), for n=1..100</a>
%H 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, 2022 (to appear).
%Y 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 nonn,base
%O 1,2
%A _N. J. A. Sloane_, Mar 19 2014
|
