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 A058888 #17 Nov 07 2024 08:46:55
%S A058888 4,4,2,0,2,0,0,0,2,2,0,0,2,0,0,2,0,0,0,0,0,0,2,2,0,0,0,0,0,2,0,2,0,0,
%T A058888 0,0,0,0,0,2,2,0,2,0,0,0,0,0,0,0,2,2,0,2,0,0,0,0,0,2,0,2,0,0,0,0,0,0,
%U A058888 0,0,0,2,0,0,0,0,0,0,0,0,2,0,2,0,0,2,0,0,0,0,0,0,0,2,0,0,2,0,0,0,0,0,0,0,0
%N A058888 Number of terms in the set invphi(2*prime(n)), where prime(n) is the n-th prime.
%H A058888 Amiram Eldar, <a href="/A058888/b058888.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..1000 from Donovan Johnson)
%H A058888 Max Alekseyev, <a href="https://oeis.org/wiki/User:Max_Alekseyev/gpscripts">PARI/GP Scripts for Miscellaneous Math Problems</a> (invphi.gp).
%e A058888 The set invphi(2*3) = {7,9,14,18}. It has 4 terms, so a(2) = 4, while invphi(2*1601) = {3203,6406}, thus a(252) = 2.
%p A058888 with(numtheory): [seq(nops(invphi(2*ithprime(i))),i=1..256)];
%o A058888 (PARI) a(n) = invphiNum(2*prime(n)); \\ _Amiram Eldar_, Nov 07 2024, using _Max Alekseyev_'s invphi.gp
%Y A058888 Cf. A000010, A002202, A005277, A007617, A071629-A071634.
%K A058888 nonn
%O A058888 1,1
%A A058888 _Labos Elemer_, Jan 08 2001
%E A058888 Offset corrected by _Donovan Johnson_, Apr 28 2013