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 A365739 #13 Jun 02 2025 15:27:18 %S A365739 0,2,3,4,15,61,881,10394,111047 %N A365739 a(n)=A365339(10^n)-A365740(10^n). %C A365739 Pollack et al. conjectured that a(n) > 2 for n > 4. %H A365739 Paul Pollack, Carl Pomerance and Enrique Treviño, <a href="https://math.dartmouth.edu/~carlp/MonotonePhi.pdf">Sets of monotonicity for Euler's totient function</a>, preprint. See M↑(n) and M2(n). %H A365739 Paul Pollack, Carl Pomerance and Enrique Treviño, <a href="https://doi.org/10.1007/s11139-012-9386-6">Sets of monotonicity for Euler's totient function</a>, Ramanujan J. 30 (2013), no. 3, 379--398. %H A365739 Terence Tao, <a href="https://arxiv.org/abs/2309.02325">Monotone non-decreasing sequences of the Euler totient function</a>, arXiv:2309.02325 [math.NT], 2023. %Y A365739 Cf. A000010, A000720. %Y A365739 Cf. A365339, A365398, A365399, A365400, A365474, A365737, A061070. %K A365739 nonn,hard,more %O A365739 0,2 %A A365739 _Chai Wah Wu_, Sep 17 2023