|
|
A053761
|
|
Least positive integer k for which the Jacobi symbol (k|2*n-1) is less than 1, where 2*n-1 is a nonsquare; a(n)=0 if 2*n-1 is a square.
|
|
3
|
|
|
0, 2, 2, 3, 0, 2, 2, 3, 3, 2, 2, 5, 0, 2, 2, 3, 3, 2, 2, 3, 3, 2, 2, 5, 0, 2, 2, 3, 3, 2, 2, 3, 3, 2, 2, 7, 5, 2, 2, 3, 0, 2, 2, 3, 3, 2, 2, 5, 5, 2, 2, 3, 3, 2, 2, 3, 3, 2, 2, 7, 0, 2, 2, 3, 3, 2, 2, 3, 3, 2, 2, 5, 5, 2, 2, 3, 3, 2, 2, 3, 3, 2, 2, 5, 0, 2, 2, 3, 3, 2, 2, 3, 3, 2, 2, 7, 5, 2, 2, 3
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
REFERENCES
|
Steven R. Finch, Mathematical Constants, Cambridge, 2003, pp. 443-448.
Paulo Ribenboim, The New Book of Prime Number Records, 3rd ed., Springer-Verlag 1996; Math. Rev. 96k:11112.
|
|
LINKS
|
R. Baillie and S. S. Wagstaff, Lucas pseudoprimes, Math. Comp. 35 (1980) 1391-1417; Math. Rev. 81j:10005
|
|
FORMULA
|
|
|
MAPLE
|
A053761 := proc(n) if issqr(2*n-1) then return 0 ; else for k from 1 do if numtheory[jacobi](k, 2*n-1) < 1 then return k; end if; end do: end if; end proc: seq(A053761(n), n=1..100) ; # R. J. Mathar, Aug 08 2010
|
|
MATHEMATICA
|
a[n_] := If[IntegerQ[Sqrt[2*n - 1]], Return[0], For[ k = 1, True, k++, If[ JacobiSymbol[k, 2*n - 1] < 1 , Return[k]]]]; Table[a[n], {n, 1, 100}] (* Jean-François Alcover, Jun 20 2013, after R. J. Mathar *)
|
|
PROG
|
(PARI)
A112046(n) = for(i=1, (2*n), if((kronecker(i, (n+n+1)) < 1), return(i)));
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|