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 A274116 #17 Jun 17 2016 02:15:39 %S A274116 220,284,366,378,2620,2924,3864,4584,5020,5564,16104,16536,16632, %T A274116 16728,26448,28752,29760,30912,43524,53692,63020,67344,69552,69615, %U A274116 76084,87633,100485,122265,124155,139815,142290,142310,168730,179118,196248,196724,198990,202444 %N A274116 (1+e)-sigma amicable numbers. %C A274116 The first time a pair ordered by its first element is not adjacent is x = 16104, y = 16632 which correspond to a(11) and a(13), respectively. %H A274116 Paolo P. Lava, <a href="/A274116/b274116.txt">Table of n, a(n) for n = 1..500</a> %e A274116 (1+e)-sigma(366) = 378 and (1+e)-sigma(378) = 366. %p A274116 with(numtheory): T:=proc(n) local a,d,p,e,s,sp; a:=1; %p A274116 for d in ifactors(n)[2] do p:=op(1,d); e:= op(2,d); sp:=1; %p A274116 for s in divisors(e) do sp:=sp+p^s; od: a:=a*sp; od: a; end: %p A274116 P:=proc(q) local n,x,y; for n from 1 to q do x:=T(n)-n; y:=T(x)-x; %p A274116 if n=y and x<>y then print(n); fi; od; end: P(10^10); %Y A274116 Cf. A049603, A051378, A274118. %K A274116 nonn,easy %O A274116 1,1 %A A274116 _Paolo P. Lava_, Jun 10 2016