A227196 a(n) = first i >= 1 for which the Kronecker symbol K(i,n) is not +1 (i.e., is either 0 or -1), 0 if no such i exists.
0, 2, 2, 2, 2, 2, 3, 2, 3, 2, 2, 2, 2, 2, 3, 2, 3, 2, 2, 2, 2, 2, 5, 2, 5, 2, 2, 2, 2, 2, 3, 2, 3, 2, 2, 2, 2, 2, 3, 2, 3, 2, 2, 2, 2, 2, 5, 2, 7, 2, 2, 2, 2, 2, 3, 2, 3, 2, 2, 2, 2, 2, 3, 2, 3, 2, 2, 2, 2, 2, 7, 2, 5, 2, 2, 2, 2, 2, 3, 2, 3, 2, 2, 2, 2, 2, 3
Offset: 1
Keywords
Links
- A.H.M. Smeets, Table of n, a(n) for n = 1..20163 (first 87 terms from Antti Karttunen)
Crossrefs
Programs
-
PARI
a(n) = for(k=1,n,if(kronecker(k,n)<1, return(k))) for(n=1,120, print1(a(n),", "))
Formula
A227195(n) = a(n)-1 for all n>=2.
a(2n+1) = A112046(n) for all n>0. - A.H.M. Smeets Jan 29 2018
Comments