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