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”).

A101701
Numbers n such that n = sum of the reversals of divisors of n.
1
1, 207321, 890827, 7591023, 18368601, 4885292403
OFFSET
1,2
COMMENTS
a(7) > 10^11. - Donovan Johnson, Dec 27 2013
EXAMPLE
18368601 is in the sequence because divisors of 18368601 are 1, 3, 6122867, 18368601 and 18368601 = 1 + 3 + 7682216 + 10686381.
MATHEMATICA
Do[h = Divisors[n]; l = Length[h]; If[n == Sum[ FromDigits[Reverse[IntegerDigits[h[[k]]]]], {k, l}], Print[n]], {n, 370000000}]
PROG
(Python)
from sympy import divisors
A101701_list = [n for n in range(1, 10**6) if n == sum([int(d) for d in (str(x)[::-1] for x in divisors(n))])]
# Chai Wah Wu, Dec 06 2014
CROSSREFS
Sequence in context: A115946 A082176 A178285 * A092011 A362758 A216900
KEYWORD
base,more,nonn
AUTHOR
Farideh Firoozbakht, Dec 23 2004
EXTENSIONS
a(6) from Donovan Johnson, Dec 07 2008
STATUS
approved