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 A332516 #15 Dec 11 2024 06:39:18 %S A332516 11,22,23,46,47,59,71,83,94,107,118,131,142,166,167,179,191,214,227, %T A332516 239,251,262,263,311,334,347,358,359,382,383,419,431,443,454,467,478, %U A332516 479,491,502,503,526,563,587,599,622,647,659,683,694,718,719,743,766,827 %N A332516 Numbers k such that phi(k) == 10 (mod 12), where phi is the Euler totient function (A000010). %C A332516 Dence and Pomerance showed that the asymptotic number of the terms below x is ~ (3/8) * x/log(x). %H A332516 Amiram Eldar, <a href="/A332516/b332516.txt">Table of n, a(n) for n = 1..10000</a> %H A332516 Thomas Dence and Carl Pomerance, <a href="https://doi.org/10.1007/978-1-4757-4507-8_2">Euler's function in residue classes</a>, in: K. Alladi, P. D. T. A. Elliott, A. Granville and G. Tenenbaum (eds.), Analytic and Elementary Number Theory, Developments in Mathematics, Vol. 1, Springer, Boston, MA, 1998, pp. 7-20, <a href="https://math.dartmouth.edu/~carlp/PDF/paper116.pdf">alternative link</a>. %e A332516 23 is a term since phi(23) = 22 == 10 (mod 12). %t A332516 Select[Range[800], Mod[EulerPhi[#], 12] == 10 &] %o A332516 (Magma) [k:k in [1..850]| EulerPhi(k) mod 12 eq 10]; // _Marius A. Burtea_, Feb 14 2020 %Y A332516 Cf. A000010, A017641, A332511, A332512, A332513, A332514, A332515. %K A332516 nonn %O A332516 1,1 %A A332516 _Amiram Eldar_, Feb 14 2020