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 A061106 #20 Jan 20 2023 19:43:30
%S A061106 2,2,4,4,6,6,8,8,8,12,16,12,20,16,18,16,20,24,24,24,32,24,24,40,32,48,
%T A061106 36,40,32,48,40,44,48,40,48,54,80,48,56,48,60,64,84,60,48,72,96,72,88,
%U A061106 72,64,80,72,84,80,72,88,96,92,96,80,120,96,144,80,96,108,112,120,116
%N A061106 Compute Euler totient function for the prime(n+1)-prime(n)-1 composite numbers between two consecutive primes; choose the smallest.
%H A061106 Harry J. Smith, <a href="/A061106/b061106.txt">Table of n, a(n) for n = 2..1000</a>
%F A061106 a(n) = Min{phi(c) : prime(n) < c < prime(n+1)}.
%e A061106 p(30)=113 is followed by 13 composites; phi of these are {36, 88, 56, 72, 58, 96, 32, 110, 60, 80, 60, 100, 36}, the smallest of which is 32=a(30) and the largest is 110.
%t A061106 Min[EulerPhi[Range[First[#]+1,Last[#]-1]]]&/@Partition[Prime[Range[ 2,80]],2,1] (* _Harvey P. Dale_, Aug 18 2011 *)
%t A061106 Table[Min[EulerPhi[Range[Prime[i], Prime[i+1]]]], {i, 2, 100}] (* _T. D. Noe_, Aug 18 2011 *)
%o A061106 (PARI) { n=1; q=3; m=10^6; forprime (p=5, prime(1003), a=m; for (i=q + 1, p - 1, a=min(eulerphi(i), a)); q=p; write("b061106.txt", n++, " ", a) ) } \\ _Harry J. Smith_, Jul 18 2009
%Y A061106 Cf. A000010, A061108.
%K A061106 nonn
%O A061106 2,1
%A A061106 _Labos Elemer_, May 29 2001