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 A071634 #14 Nov 11 2024 05:24:15
%S A071634 23,112,81,64,75,48,36,28,43,68,14,80,35,50,0,43,28,28,46,52,44,32,38,
%T A071634 49,48,37,10,34,24,47,34,65,19,28,59,20,32,82,15,30,61,32,48,62,10,32,
%U A071634 2,26,18,16,65,77,0,46,8,0,43,18,56,60,0,38,40,13,36,26,44,46,41,12,0
%N A071634 Number of terms in the set InvPhi(1048576*prime(n)), where prime(n) is the n-th prime.
%H A071634 Donovan Johnson, <a href="/A071634/b071634.txt">Table of n, a(n) for n = 1..1000</a>
%H A071634 Max Alekseyev, <a href="https://oeis.org/wiki/User:Max_Alekseyev/gpscripts">PARI/GP Scripts for Miscellaneous Math Problems</a> (invphi.gp).
%e A071634 InvPhi(1048576*211) = {221249537,442499074}, a(47) = 2.
%e A071634 Observe that a(15) = 0 because 47 needs a very large 2^i multiplier (instead of 1048576) to give a nonempty InvPhi set.
%p A071634 >[seq(nops(invphi(1048576*ithprime(i))),i=1..128)];
%o A071634 (PARI) a(n) = invphiNum(1048576 * prime(n)); \\ _Amiram Eldar_, Nov 11 2024, using _Max Alekseyev_'s invphi.gp
%Y A071634 Cf. A000010, A002202, A005277, A007617, A058888, A071629, A071630, A071631, A071632, A071633.
%K A071634 nonn
%O A071634 1,1
%A A071634 _Labos Elemer_, May 30 2002