login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A046353
Odd composite numbers whose sum of prime factors is palindromic (counted with multiplicity).
3
9, 15, 27, 45, 57, 85, 121, 123, 259, 305, 351, 403, 413, 415, 483, 495, 575, 597, 627, 639, 663, 687, 689, 705, 717, 735, 807, 875, 893, 931, 935, 985, 989, 1073, 1135, 1183, 1203, 1207, 1263, 1285, 1293, 1331, 1353, 1383, 1385, 1407, 1473, 1505, 1545
OFFSET
1,1
EXAMPLE
689 = 13 * 53 -> 13 + 53 = 66 and 66 is a palindrome.
MATHEMATICA
palQ[n_]:=Reverse[x=IntegerDigits[n]]==x; Select[Range[9, 1545, 2], !PrimeQ[#]&&palQ[Total[Times@@@FactorInteger[#]]]&] (* Jayanta Basu, Jun 05 2013 *)
PROG
(Python)
from sympy import factorint
def is_046353(n):
if n % 2 == 0: return False
f = factorint(n)
if sum([f[i] for i in f]) < 2: return False
sfa = sum([i*f[i] for i in f])
if sfa == int(str(sfa)[::-1]): return True
return False # John Cerkan, Apr 24 2018
CROSSREFS
Sequence in context: A164385 A339519 A258813 * A340095 A046356 A248381
KEYWORD
nonn,base
AUTHOR
Patrick De Geest, Jun 15 1998
EXTENSIONS
Name clarified and offset changed by John Cerkan, Apr 24 2018
STATUS
approved