|
%I #7 Jul 16 2022 01:32:19
%S 1,0,1,0,1,1,0,0,0,0,0,0,0,1,1,0,1,0,0,1,0,1,0,0,1,1,1,0,0,0,0,0,1,0,
%T 1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,1,0,0,0,0,0,0,0,0,0,0,0,0,
%U 0,1,0,1,0,0,0,1,0,0,0,1,0,1,0,1,0,0,0
%N a(n) = 1 if the smallest b > 1 such that b^(p-1) == 1 (mod p^2) is prime, 0 otherwise, with p = prime(n).
%F a(n) = A010051(A039678(n)).
%o (PARI) a(n) = my(p=prime(n)); for(b=2, oo, if(Mod(b, p^2)^(p-1)==1, return(ispseudoprime(b))))
%Y Cf. A010051, A039678, A355656, A355657.
%K nonn
%O 1
%A _Felix Fröhlich_, Jul 12 2022
|
