OFFSET
1,2
LINKS
Indranil Ghosh, Table of n, a(n) for n = 1..10000
EXAMPLE
n=14: a(14)=1+2+7=10;
n=101: a(101)=1+101=102;
MAPLE
A088000 := proc(n)
a := 0 ;
for d in numtheory[divisors](n) do
if isA002113(d) then
a := a+d ;
end if;
end do;
a ;
end proc:
seq(A088000(n), n=1..100) ; # R. J. Mathar, Sep 09 2015
MATHEMATICA
Table[Plus @@ Select[Divisors[k], Reverse[x = IntegerDigits[#]] == x &], {k, 86}] (* Jayanta Basu, Aug 12 2013 *)
PROG
(Python)
def ispal(n):
return n==int(str(n)[::-1])
def A088000(n):
s=0
for i in range(1, n+1):
if n%i==0 and ispal(i):
s+=i
return s
print([A088000(n) for n in range(1, 30)]) # Indranil Ghosh, Feb 10 2017
(PARI) a(n) = sumdiv(n, d, my(dd=digits(d)); if (Vecrev(dd) == dd, d)); \\ Michel Marcus, Apr 06 2020
CROSSREFS
KEYWORD
base,nonn
AUTHOR
Labos Elemer, Oct 14 2003
STATUS
approved