OFFSET
1,1
LINKS
Harvey P. Dale, Table of n, a(n) for n = 1..1000
MATHEMATICA
pp[n_]:=Module[{k=n+1}, While[GCD@@FactorInteger[n*10^IntegerLength[ k]+ k][[All, 2]]<2, k++]; k]; Array[pp, 70] (* Harvey P. Dale, Oct 09 2016 *)
PROG
(PARI)
a(n)=s=Str(n); k=n+1; while(!ispower(eval(concat(s, Str(k)))), k++); return(k)
vector(100, n, a(n))
(Python)
from sympy import perfect_power
def a(n):
s, k = str(n), n+1
while not perfect_power(int(s+str(k))): k += 1
return k
print([a(n) for n in range(1, 67)]) # Michael S. Branicky, Jun 05 2021
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Derek Orr, Aug 18 2014
STATUS
approved