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 A043343 #22 Nov 13 2024 08:30:20
%S A043343 2,6,12,18,22,30,42,46,54,58,60,62,66,90,94,98,106,118,120,126,134,
%T A043343 138,142,150,158,162,166,174,198,206,210,214,240,242,250,254,262,270,
%U A043343 274,276,278,282,294,298,302,318,330,334,346,348,354,358,378,382,394,398
%N A043343 Numbers m such that there is no k > m such that phi(k) = phi(m), where phi is Euler's totient function.
%H A043343 Amiram Eldar, <a href="/A043343/b043343.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..980 from Paul Tek)
%H A043343 Max Alekseyev, <a href="https://oeis.org/wiki/User:Max_Alekseyev/gpscripts">PARI/GP Scripts for Miscellaneous Math Problems</a> (invphi.gp).
%F A043343 A066659(a(n)) = 0.
%F A043343 A028476(a(n)) = a(n).
%t A043343 Flatten@ Position[#, 0] &@ Table[k = n + 1; While[And[k <= 2 n + 1, EulerPhi@ k != EulerPhi@ n], k++]; Boole[k < 2 n + 1] k, {n, 400}] (* _Michael De Vlieger_, Dec 31 2016 *)
%o A043343 (PARI) is(k) = #select(x -> x>k, invphi(eulerphi(k))) == 0; \\ _Amiram Eldar_, Nov 12 2024, using _Max Alekseyev_'s invphi.gp
%Y A043343 Cf. A000010, A028476, A066659.
%K A043343 nonn
%O A043343 1,1
%A A043343 _Vladeta Jovovic_, Jan 12 2002
%E A043343 Offset corrected by _Paul Tek_, Sep 25 2015
%E A043343 Definition clarified by _Alonso del Arte_, Dec 31 2016