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