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 A110597 #15 Dec 04 2019 13:00:04 %S A110597 1,1045,29029,50065,64285,87685,1390753,2011009,3189625,7711405, %T A110597 39298441,53238625,68393065,75416341,96345613,225938245,228404605, %U A110597 231562825,233591605,279999445,458406445,462027565,470527057,491291125,513574369,663605761,666373825 %N A110597 Balanced numbers (A020492) k such that k mod 12 = 1. %C A110597 For the first 27 terms, the quotient sigma(n)/phi(n) is 1, 2 or 3. %H A110597 Amiram Eldar, <a href="/A110597/b110597.txt">Table of n, a(n) for n = 1..8224</a> (terms below 6.5*10^14, calculated using data from Jud McCranie) %p A110597 with(numtheory); BNM1:=[]: for z from 1 to 1 do for m from 0 to 500000 do n:=12*m+1; if sigma(n) mod phi(n) = 0 then BNM1:=[op(BNM1),n] fi; od; od; BNM1; %t A110597 Select[Range[10^7], Mod[#, 12] == 1 && Divisible[DivisorSigma[1, #], EulerPhi[#]] &] (* _Amiram Eldar_, Dec 04 2019 *) %o A110597 (PARI) forstep(n=1,1e5,12, if(sigma(n)%eulerphi(n)==0, print1(n", "))) \\ _Charles R Greathouse IV_, Nov 27 2013 %Y A110597 Intersection of A017533 and A020492. %Y A110597 Cf. A000010, A000203, A062699. %K A110597 nonn %O A110597 1,2 %A A110597 _Walter Kehowski_, Sep 13 2005 %E A110597 a(10)-a(27) from _Donovan Johnson_, Aug 30 2012