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 A244251 #21 May 09 2021 17:48:41 %S A244251 6,98,145,244,285,133857 %N A244251 Numbers k such that if m = (sum of the reverses of the aliquot parts of k) then k = (sum of the reverses of the aliquot parts of m). %C A244251 A072228 is a subsequence of this sequence. %e A244251 Aliquot parts of 98 are 1, 2, 7, 14, 49 and the sum of their reverses is 1 + 2 + 7 + 41 + 94 = 145. Aliquot parts of 145 are 1, 5, 29 and the sum of their reverses is 1 + 5 + 92 = 98. %p A244251 with(numtheory): T:=proc(w) local x,y,z; x:=0; y:=w; %p A244251 for z from 1 to ilog10(w)+1 do x:=10*x+(y mod 10); y:=trunc(y/10); od; x; end: %p A244251 P:=proc(q) local a,b,k,n; for n from 1 to q do %p A244251 a:=sort([op(divisors(n))]); b:=add(T(a[k]),k=1..nops(a)-1); a:=sort([op(divisors(b))]); b:=add(T(a[k]),k=1..nops(a)-1); %p A244251 if b=n then print(n); fi; od; end: P(10^12); %Y A244251 Cf. A072228. %K A244251 nonn,more,base %O A244251 1,1 %A A244251 _Paolo P. Lava_, Dec 09 2014