

A101701


Numbers n such that n = sum of the reversals of divisors of n.


1




OFFSET

1,2


COMMENTS

a(7) > 10^11.  Donovan Johnson, Dec 27 2013


LINKS

Table of n, a(n) for n=1..6.


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

Cf. A069942, A072228.
Sequence in context: A115946 A082176 A178285 * A092011 A216900 A072679
Adjacent sequences: A101698 A101699 A101700 * A101702 A101703 A101704


KEYWORD

base,more,nonn


AUTHOR

Farideh Firoozbakht, Dec 23 2004


EXTENSIONS

a(6) from Donovan Johnson, Dec 07 2008


STATUS

approved



