login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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.
6
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,2
COMMENTS
a(1) = 0, because K(i,1) is 1 for all i. After that, A112046 interleaved with A007395.
All terms beyond a(1) = 0 are prime numbers. Heuristically a(n) is 2 3/4 of the time, 3 1/6 of the time, 5 1/20 of the time, 7 2/105 of the time, etc. The average value is 2.5738775742512.... - Charles R Greathouse IV, Jan 30 2018
LINKS
A.H.M. Smeets, Table of n, a(n) for n = 1..20163 (first 87 terms from Antti Karttunen)
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
PROG
(PARI) a(n) = for(k=1, n, if(kronecker(k, n)<1, return(k)))
for(n=1, 120, print1(a(n), ", "))
CROSSREFS
Bisections: A112046 (for odd terms from 3 onward), A007395 (all even terms).
Sequence in context: A120676 A184172 A125973 * A189172 A286888 A257212
KEYWORD
nonn
AUTHOR
Antti Karttunen, Jul 06 2013
STATUS
approved