OFFSET
1,1
COMMENTS
MAPLE
d:= n-> n*add(i[2]/i[1], i=ifactors(n)[2]):
q:= n-> (k-> isprime(k) and StringTools[IsPalindrome](""||k))(d(n)):
select(q, [$1..25000])[]; # Alois P. Heinz, Jan 29 2023
MATHEMATICA
d[0] = d[1] = 0; d[n_] := n * Plus @@ ((Last[#]/First[#]) & /@ FactorInteger[n]); Select[Range[25000], PrimeQ[p = d[#]] && PalindromeQ[p] &] (* Amiram Eldar, Jan 29 2023 *)
PROG
(Magma) f:=func<n |n le 1 select 0 else n*(&+[Factorisation(n)[i][2] / Factorisation(n)[i][1]: i in [1..#Factorisation(n)]])>; pal:=func<n|Intseq(n) eq
Reverse(Intseq(n))>; [p:p in [1..25000]|pal(Floor(f(p)) and IsPrime(Floor(f(p)))];
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Marius A. Burtea, Jan 29 2023
STATUS
approved