|
%I #57 Nov 09 2022 19:10:08
%S 17,13,131,107,383,613,43607,1021,334403,26099,40637,138967,212867,
%T 360049,502210997,2227399,5682166613,7339303,13630913,35650627,
%U 92273957,142605709,4424729404133,671087119,42364430471219,2684353351,404156666702231,10737417109,4872756792902003
%N a(n) is the least prime p such that A234575(p, A007953(p)) is the n-th power of a prime.
%C a(n) is the least prime p such that the sum of the quotient and remainder on division of p by the sum of digits of p is the n-th power of an integer.
%H Robert Israel, <a href="/A357190/b357190.txt">Table of n, a(n) for n = 1..100</a>
%e a(3) = 131 because 131 is prime, has sum of digits 5, 131 = 26*5 + 1 and 26 + 1 = 27 = 3^3 where 3 is prime; and 131 is the least prime that works.
%p g:= proc(t,M) local s,q,r,n;
%p for s from 2 to 9*M do
%p for r from s-1 to 1 by -1 do
%p q:= t-r;
%p n:= q*s+r;
%p if convert(convert(n,base,10),`+`) = s and isprime(n) then return n fi;
%p if n >= 10^M then return -1 fi;
%p od od;
%p -1
%p end proc:
%p G:= proc(m) local i,M,found,v,r;
%p found:= false; r:= infinity;
%p for M from 3 while not found do
%p for i from 1 while ithprime(i)^m < 10^M do
%p v:= g(ithprime(i)^m, M);
%p if v > 0 then found:= true; r:= min(v,r) fi
%p od od:
%p r
%p end proc:
%p map(G, [$1..30]);
%Y Cf. A007953, A234575.
%K nonn,base
%O 1,1
%A _J. M. Bergot_ and _Robert Israel_, Oct 25 2022
|
