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 A071631 #16 Nov 07 2024 08:32:41
%S A071631 7,11,10,6,8,4,5,0,5,8,0,6,5,4,0,5,0,2,4,3,4,4,5,5,6,3,0,3,0,5,4,8,3,
%T A071631 4,3,2,0,6,0,5,8,2,5,6,0,4,0,0,0,0,5,8,0,5,0,0,3,2,4,5,0,5,4,0,2,0,2,
%U A071631 2,3,0,0,5,0,4,0,0,0,2,3,4,5,2,8,4,0,5,3,0,0,0,0,3,6,8,4,0,8,0,2,0,2,3,0,0
%N A071631 Number of terms in the set InvPhi(16*prime(n)), where prime(n) is the n-th prime.
%H A071631 Amiram Eldar, <a href="/A071631/b071631.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..1000 from Donovan Johnson)
%H A071631 Max Alekseyev, <a href="https://oeis.org/wiki/User:Max_Alekseyev/gpscripts">PARI/GP Scripts for Miscellaneous Math Problems</a> (invphi.gp).
%e A071631 invphi(16*29) = {699,885,932,944,1180,1398,1416,1770} so a(10) = 8.
%p A071631 [seq(nops(invphi(16*ithprime(i))),i=1..128)];
%o A071631 (PARI) a(n) = invphiNum(16*prime(n)); \\ _Amiram Eldar_, Nov 07 2024, using _Max Alekseyev_'s invphi.gp
%Y A071631 Cf. A000010, A002202, A005277, A007617, A058888, A071629-A071634.
%K A071631 nonn
%O A071631 1,1
%A A071631 _Labos Elemer_, May 30 2002