OFFSET
1,1
LINKS
Scott R. Shannon, Table of n, a(n) for n = 1..10000
EXAMPLE
360 is a term as 360 = 2^3*3^2*5 that has a sum of distinct prime factors of 2+3+5 = 10, while the digit reversal of 360 is 63 = 3^2*7 that has a sum of distinct prime factors of 3+7 = 10.
MATHEMATICA
q[k_]:=!PalindromeQ[k]&&Total[First/@FactorInteger[k]]==Total[First/@FactorInteger[IntegerReverse[k]]]; Select[Range[16237], q] (* James C. McMahon, Mar 05 2026 *)
PROG
(PARI) sopf(n) = my(fac=factor(n)); sum(i=1, matsize(fac)[1], fac[i, 1]); \\ A008472
isok(k) = my(d=digits(k)); if (d != Vecrev(d), sopf(k) == sopf(fromdigits(Vecrev(d)))); \\ Michel Marcus, Mar 05 2026
(Python)
from sympy import factorint
def sopf(n): return sum(factorint(n))
def ok(n): return n != (r:=int(str(n)[::-1])) and sopf(n) == sopf(r)
print([k for k in range(20000) if ok(k)]) # Michael S. Branicky, Mar 05 2026
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Scott R. Shannon, Mar 05 2026
STATUS
approved
