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 A360140 #45 Feb 01 2023 08:16:55 %S A360140 445953248528881275,659008669204392325,748174019876835825, %T A360140 906104451346869775,1097581690986390225,1615281291559017775, %U A360140 1281431098689616875,1769164614201263125,1968382462511781225,2982869282783783575,1993991197249826775,2901232579265245225,2247817805416685775,2726235257034514225 %N A360140 Odd amicable pairs with only one member divisible by 3. %C A360140 In these pairs only the smaller number is divisible by 3 and both the smaller and the larger number are divisible by 5, 7, and 25. These pairs prove that there are odd amicable pairs where only one of the numbers is divisible by 3. %D A360140 Richard K. Guy, Unsolved Problems in Number Theory. Springer, 2004, page 88. %H A360140 S. Battiato and W. Borho, <a href="https://doi.org/10.1090/S0025-5718-1988-0929559-5">Are There Odd Amicable Numbers Not Divisible by Three</a>, Mathematics of Computation, Apr., 1988, Vol. 50, No. 182, pp. 633-637. %H A360140 S. Chernykh, <a href="https://sech.me/ap/news.html#20160130">Amicable pairs where the two members have different smallest prime factors</a>, January 30th, 2016. %H A360140 Zoltan Galantai, <a href="/A360140/a360140.txt">List of 31 known pairs</a> %e A360140 (445953248528881275, 659008669204392325) belongs to the sequence since the smaller number is divisible by 3 and the larger is not. The (12285, 14595) pair is not a part of the sequence, since both of its members are divisible by 3. %Y A360140 Cf. A259180, A002025, A002046, A262623. %K A360140 nonn %O A360140 1,1 %A A360140 _Zoltan Galantai_, Jan 26 2023