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 A035113 #29 Jul 02 2025 16:01:56 %S A035113 1,3,4,5,8,12,7,9,15,16,20,24,11,13,21,28,36,17,32,40,48,60,19,27,25, %T A035113 33,44,23,35,39,45,52,56,72,84,29,31,51,64,68,80,96,120,37,57,63,76, %U A035113 108,41,55,75,88,100,132,43,49,69,92,47,65,104,105,112,140,144 %N A035113 Numbers != 2 (mod 4) listed in order of increasing totient function phi (A000010). %H A035113 Dumitru Damian, <a href="/A035113/b035113.txt">Table of n, a(n) for n = 1..10000</a> %H A035113 L. C. Washington, <a href="https://doi.org/10.1007/978-1-4612-1934-7_15">The Main Conjecture and Annihilation of Class Groups</a>, In: Introduction to Cyclotomic Fields, Graduate Texts in Mathematics, vol 83 (1997) Springer, New York, NY. %e A035113 phi(1)=1, phi(3)=2, phi(4)=2, phi(5)=4, ... %o A035113 (Python) from sympy import totient as A000010 %o A035113 def lov(n): return sorted([[A000010(n), n] for n in range(1,n) if n%4 != 2]) %o A035113 print([x[1] for x in lov(200)][:100]) # _Dumitru Damian_, Feb 01 2022 %Y A035113 Cf. A000010, A035114. %Y A035113 Cf. A002181, A002202, A007614, A014197, A016825, A032447, A058277. %K A035113 nonn,easy %O A035113 1,2 %A A035113 _N. J. A. Sloane_ %E A035113 More terms from _James Sellers_ %E A035113 a(43) onward corrected by _Sean A. Irvine_, Sep 26 2020