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 A069797 #11 Jun 14 2022 17:14:45
%S A069797 2,3,4,5,8,7,9,10,13,12,22,13,21,18,16,17,32,19,27,24,26,25,46,30,33,
%T A069797 28,37,35,58,32,61,34,41,40,39,37,57,54,45,48,55,45,49,50,52,67,94,51,
%U A069797 86,55,64,56,106,57,75,65,63,87,118,64,77,77,73,68,97,75,134,80,89,72
%N A069797 Smallest k>n such that phi(n) divides phi(k).
%H A069797 Ivan Neretin, <a href="/A069797/b069797.txt">Table of n, a(n) for n = 1..10000</a>
%t A069797 sk[n_]:=Module[{p1=EulerPhi[n], k=n+1},While[Mod[EulerPhi[k],p1]!=0,k++];k]; Array[sk,70] (* _Harvey P. Dale_, Jun 14 2022 *)
%o A069797 (PARI) for(s=1,80,n=s+1; while(frac(eulerphi(n)/eulerphi(s))>0,n++); print1(n,","); )
%K A069797 easy,nonn
%O A069797 1,1
%A A069797 _Benoit Cloitre_, May 01 2002