|
%I #13 Apr 20 2024 16:18:55
%S 127,1467,3052,5860,653230,3483702,43352128,783820873,8092385362,
%T 622196951140,1061882796441600145,178949702436677222562
%N Numbers k>0 such that k = (sum of digits of k^2) + (product of nonzero digits of k^2).
%H René-Louis Clerc, <a href="https://hal.science/hal-04507547">Nombres S+P, maxSP, minSP et |P-S|</a>, pp. 1-15, 2024.
%e 1467^2 = 2152089, (2+1+5+2+8+9) + (2*1*5*2*8*9) = 27 + 1440 = 1467.
%o (PARI) SplusP(k,r) = my(d=select(x->(x>0),digits(k^r))); vecsum(d) + vecprod(d) == k;
%o resuSplusP(p,r)=for(k=1,10^p,if(SplusP(k,r) ==1,print1(k,",")))
%Y Cf. A038364, A061763.
%K nonn,base,more
%O 1,1
%A _René-Louis Clerc_, Mar 19 2024
%E a(9)-a(12) from _Chai Wah Wu_, Apr 20 2024
|
