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