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 A192292 #23 Sep 28 2015 03:31:46 %S A192292 7,10,14,16,45,86,2379,2324,4213,5866,27323,33604,1303227,1737628, %T A192292 3722831,4208308,15752651,18706108,6094085371,8114352508,30090695519, %U A192292 40119052564 %N A192292 Pairs of numbers a, b for which sigma*(a)=b and sigma(b)-b-1=a, where sigma*(n) is the sum of the anti-divisors of n. %C A192292 Betrothed numbers mixed with anti-divisors. %C A192292 a(23) > 10^11. - _Hiroaki Yamanouchi_, Sep 28 2015 %e A192292 sigma*(45)= 2+6+7+10+13+18+30 = 86. %e A192292 sigma(86)-86-1 = 2+43 = 45. %e A192292 sigma*(2379) = 2+6+26+67+71+78+122+366+1586 = 2374. %e A192292 sigma(2324)-2324-1 = 2+4+7+14+28+83+166+332+581+1162 = 2379. %p A192292 with(numtheory); P:= proc(n) local b,c,i,j,k; %p A192292 for i from 3 to n do k:=0; j:=i; %p A192292 while j mod 2 <> 1 do k:=k+1; j:=j/2; od; %p A192292 b:=sigma(2*i+1)+sigma(2*i-1)+sigma(i/2^k)*2^(k+1)-6*i-2; %p A192292 if sigma(b)-b-1=i then print(i); print(b); fi; %p A192292 od; end: P(10^9); %Y A192292 Cf. A005276, A066272, A192290, A192291, A192293. %K A192292 nonn,more,tabf %O A192292 1,1 %A A192292 _Paolo P. Lava_, Jun 29 2011 %E A192292 a(13)-a(14) from _Paolo P. Lava_, Dec 03 2014 %E A192292 a(7)-a(8) swapped and a(15)-a(22) added by _Hiroaki Yamanouchi_, Sep 28 2015