cp's OEIS Frontend

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.

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.

This page as a plain text file.
%I A227196 #25 Jan 11 2023 12:19:41
%S A227196 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,
%T A227196 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,
%U A227196 2,2,7,2,5,2,2,2,2,2,3,2,3,2,2,2,2,2,3
%N 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.
%C A227196 a(1) = 0, because K(i,1) is 1 for all i. After that, A112046 interleaved with A007395.
%C A227196 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
%H A227196 A.H.M. Smeets, <a href="/A227196/b227196.txt">Table of n, a(n) for n = 1..20163</a> (first 87 terms from Antti Karttunen)
%F A227196 A227195(n) = a(n)-1 for all n>=2.
%F A227196 a(2n+1) = A112046(n) for all n>0. - _A.H.M. Smeets_ Jan 29 2018
%o A227196 (PARI) a(n) = for(k=1,n,if(kronecker(k,n)<1, return(k)))
%o A227196 for(n=1,120, print1(a(n),", "))
%Y A227196 Bisections: A112046 (for odd terms from 3 onward), A007395 (all even terms).
%Y A227196 Cf. A227195, A227197, A227198, A112052.
%K A227196 nonn
%O A227196 1,2
%A A227196 _Antti Karttunen_, Jul 06 2013