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 A110192 #10 Nov 05 2024 19:03:51
%S A110192 3,3,5,5,15,8,13,15,13,15,25,15,35,21,17,17,51,21,37,32,35,25,69,32,
%T A110192 41,35,37,35,87,32,61,51,41,51,65,39,73,57,65,51,123,45,129,55,65,69,
%U A110192 141,51,129,55,85,65,159,57,123,65,73,87,177,64,143,77,73,85,97,75,161,85
%N A110192 Least k > n such that phi(k) = 2*phi(n), where phi is Euler's totient function.
%H A110192 Amiram Eldar, <a href="/A110192/b110192.txt">Table of n, a(n) for n = 1..10000</a>
%H A110192 Max Alekseyev, <a href="https://oeis.org/wiki/User:Max_Alekseyev/gpscripts">PARI/GP Scripts for Miscellaneous Math Problems</a> (invphi.gp).
%F A110192 a(n) = A110179(n) + n.
%t A110192 Table[k=n+1; e=EulerPhi[n]; While[EulerPhi[k] != 2e, k++ ]; k, {n, 100}]
%o A110192 (PARI) a(n) = vecmin(select(x -> x > n, invphi(2*eulerphi(n)))); \\ _Amiram Eldar_, Nov 05 2024, using _Max Alekseyev_'s invphi.gp
%Y A110192 Cf. A000010, A110179.
%K A110192 nonn,look
%O A110192 1,1
%A A110192 _T. D. Noe_, Jul 15 2005