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 A071633 #14 Nov 11 2024 05:23:09
%S A071633 19,82,59,46,56,34,26,20,31,52,10,56,24,34,0,30,20,20,32,37,32,24,30,
%T A071633 37,34,24,2,26,16,35,22,46,15,20,38,14,20,58,11,22,42,24,33,46,3,20,0,
%U A071633 18,10,12,44,56,0,29,8,0,31,14,38,44,0,30,28,9,24,18,30,34,29,8,0,50,6
%N A071633 Number of terms in the set InvPhi(65536*prime(n)), where prime(n) is the n-th prime.
%H A071633 Donovan Johnson, <a href="/A071633/b071633.txt">Table of n, a(n) for n = 1..1000</a>
%H A071633 Max Alekseyev, <a href="https://oeis.org/wiki/User:Max_Alekseyev/gpscripts">PARI/GP Scripts for Miscellaneous Math Problems</a> (invphi.gp).
%e A071633 invphi(65536*103) = {6750209,13500418}, so a(27) = 2.
%e A071633 Observe that a(15) = 0 because 47 needs very large 2^i multiplier (instead of 65536) to give nonempty InvPhi set.
%p A071633 [seq(nops(invphi(65536*ithprime(i))),i=1..128)];
%o A071633 (PARI) a(n) = invphiNum(65536 * prime(n)); \\ _Amiram Eldar_, Nov 11 2024, using _Max Alekseyev_'s invphi.gp
%Y A071633 Cf. A000010, A005277, A007617, A058888, A002202, A071629, A071630, A071631, A071632, A071634.
%K A071633 nonn
%O A071633 1,1
%A A071633 _Labos Elemer_, May 30 2002