This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A101701 #17 Dec 07 2014 18:07:56
%S A101701 1,207321,890827,7591023,18368601,4885292403
%N A101701 Numbers n such that n = sum of the reversals of divisors of n.
%C A101701 a(7) > 10^11. - _Donovan Johnson_, Dec 27 2013
%e A101701 18368601 is in the sequence because divisors of 18368601 are 1, 3, 6122867, 18368601 and 18368601 = 1 + 3 + 7682216 + 10686381.
%t A101701 Do[h = Divisors[n]; l = Length[h]; If[n == Sum[ FromDigits[Reverse[IntegerDigits[h[[k]]]]], {k, l}], Print[n]], {n, 370000000}]
%o A101701 (Python)
%o A101701 from sympy import divisors
%o A101701 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))])]
%o A101701 # _Chai Wah Wu_, Dec 06 2014
%Y A101701 Cf. A069942, A072228.
%K A101701 base,more,nonn
%O A101701 1,2
%A A101701 _Farideh Firoozbakht_, Dec 23 2004
%E A101701 a(6) from _Donovan Johnson_, Dec 07 2008