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 A061108 #20 Aug 17 2024 22:42:20
%S A061108 2,2,6,4,8,6,12,20,8,24,24,12,24,42,40,16,48,44,24,60,54,64,72,60,32,
%T A061108 52,36,72,110,84,108,44,120,40,120,132,82,156,120,48,160,64,96,60,180,
%U A061108 192,120,72,120,184,64,216,220,216,208,72,200,180,92,272,264,204,96
%N A061108 Compute Euler totient function for the prime(n+1)-prime(n)-1 composite numbers between two consecutive primes; choose the largest.
%H A061108 Harry J. Smith, <a href="/A061108/b061108.txt">Table of n, a(n) for n = 2..1000</a>
%F A061108 a(n) = Max{phi(c); prime(n) < c < prime(n+1)}.
%o A061108 (PARI) { n=1; q=3; forprime (p=5, prime(1003), a=0; for (i=q + 1, p - 1, a=max(eulerphi(i), a)); q=p; write("b061108.txt", n++, " ", a) ) } \\ _Harry J. Smith_, Jul 18 2009
%Y A061108 Cf. A000010, A061106.
%K A061108 nonn
%O A061108 2,1
%A A061108 _Labos Elemer_, May 29 2001
%E A061108 Offset corrected by _Michel Marcus_, Mar 21 2018