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 A369956 #13 Feb 20 2024 10:41:25
%S A369956 1,101,11,2,149,32,4,12,3,8,106,16,7,103,13,108,24,17,1019,124,43,
%T A369956 1013,113,67,114,63,10024,1024,133,83,1067,167,1044,264,314,10087,
%U A369956 1303,313,10093,1183,707,1374,1333,836,10343,1667,100264,10714,2236,10386,3114
%N A369956 a(n) is the least integer m such that the sum of the digits of m^2 is k+n where k is the number of digits of n.
%H A369956 Zhining Yang, <a href="/A369956/b369956.txt">Table of n, a(n) for n = 0..152</a>
%e A369956 a(5)=32 because 32 is the least integer with 2 digits and 32^2=1024 and 1+0+2+4=2+5.
%t A369956 Table[SelectFirst[Range@200000,Total[IntegerDigits[#^2]]==n+Length@IntegerDigits@#&],{n,0,50}]
%Y A369956 Cf. A004159, A369953, A369955.
%K A369956 nonn,base,easy
%O A369956 0,2
%A A369956 _Zhining Yang_, Feb 06 2024