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 A076246 #17 Mar 26 2025 08:32:27
%S A076246 2,4,6,10,8,16,18,22,28,46,32,52,58,54,82,64,100,102,106,148,162,166,
%T A076246 172,178,190,196,226,250,128,256,262,268,282,292,310,316,346,358,366,
%U A076246 382,388,466,478,486,502,508,556,562,568,586,606,618,642,652,676,708
%N A076246 Totients of those numbers at which values of A051547 increase: in these consecutive terms new prime powers arise, i.e., which did not occur in neither of preceding terms.
%F A076246 a(n) = phi(A076245(n + 1)). - _Sean A. Irvine_, Mar 25 2025
%e A076246 8 = 2*2*2 immediately follows 10 = 2*5; 58 = 2*29 follows 52 = 2*2*13. In both cases, the latter term has a new prime factor (like 29) or an old one at a higher power (like 2*2*2).
%t A076246 s0=1; s1=1; Do[s0=s1; s1=LCM[s1, EulerPhi[n]]; If[ !Equal[s0, s1], Print[n]], {n, 1, 1000}]
%o A076246 (PARI) lista(nn) = {least = 1; for (n=2, nn, nleast = lcm(least, eulerphi(n)); if (nleast > least, print1(eulerphi(n), ", ")); least = nleast;);} \\ _Michel Marcus_, Jul 30 2017
%Y A076246 Cf. A003418, A051451, A051547, A076244, A076245.
%K A076246 nonn
%O A076246 1,1
%A A076246 _Labos Elemer_, Oct 08 2002