|
%I #24 Sep 04 2016 22:52:10
%S 2,7,19,31,41,43,53,59,67,73,79,89,97,101,107,127,139,151,163,173,179,
%T 193,197,223,241,251,283,293,307,313,317,353,383,389,409,419,443,457,
%U 461,467,487,499,521,523,571,577,593,601,607,619,631,641,643,653,659
%N a(n) is the least prime p > a(n-1) such that a(n-1) is a quadratic residue mod p.
%C a(n-1) is a term in row a(n) of A046071. - _Reinhard Zumkeller_, May 10 2015
%H T. D. Noe, <a href="/A034794/b034794.txt">Table of n, a(n) for n=1..1000</a>
%p f:= proc(t) local i,p;
%p p:= t;
%p do
%p p:= nextprime(p);
%p if numtheory:-jacobi(t,p) = 1 then return p fi
%p od
%p end proc:
%p A[1]:= 2:
%p for n from 2 to 100 do A[n]:= f(A[n-1]) od:
%p seq(A[i],i=1..100); # _Robert Israel_, Sep 04 2016
%t f[n_] := Block[{k = PrimePi[n] + 1}, While[ JacobiSymbol[n, Prime[k]] == -1, k++ ]; Prime[k]]; NestList[f, 2, 54] (* _Robert G. Wilson v_, Mar 16 2004 *)
%o (Haskell)
%o a034794 n = a034794_list !! (n-1)
%o a034794_list = 2 : f 2 (tail a000040_list) where
%o f x (p:ps) = if elem x $ a046071_row p then p : f p ps else f x ps
%o -- _Reinhard Zumkeller_, May 10 2015
%Y Cf. A092581.
%Y Cf. A046071, A000040.
%K nonn,nice
%O 1,1
%A _David W. Wilson_
%E Mathematica updated by _Jean-François Alcover_, Jul 04 2013
%E Name corrected by _Robert Israel_, Sep 04 2016
|
