%I A047713 M5461
%S A047713 561,1105,1729,1905,2047,2465,3277,4033,4681,6601,8321,8481,10585,12801,
%T A047713 15841,16705,18705,25761,29341,30121,33153,34945,41041,42799,46657,49141,
%U A047713 52633,62745,65281,74665,75361,80581,85489,87249,88357,90751,104653
%N A047713 Euler-Jacobi pseudoprimes: 2^{(n-1)/2} == (2 / n) mod n.
%D A047713 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%D A047713 R. K. Guy, Unsolved Problems in Number Theory, A12.
%D A047713 H. Riesel, Prime numbers and computer methods for factorization, Progress 
               in Mathematics, Vol. 57, Birkhauser, Boston, 1985.
%H A047713 T. D. Noe, <a href="b047713.txt">Table of n, a(n) for n=1..1000</a>
%H A047713 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               Euler-JacobiPseudoprime.html">Link to a section of The World of Mathematics.</
               a>
%H A047713 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               Pseudoprime.html">Link to a section of The World of Mathematics.</
               a>
%H A047713 <a href="Sindx_Ps.html#pseudoprimes">Index entries for sequences related 
               to pseudoprimes</a>
%t A047713 Select[ Range[ 3, 105000, 2 ], Mod[ 2^((# - 1)/2) - JacobiSymbol[ 2, 
               # ], # ] == 0 && ! PrimeQ[ # ] & ]
%Y A047713 Cf. A002997, A001567.
%Y A047713 Sequence in context: A137198 A141705 A135721 this_sequence A006971 A104016 
               A002997
%Y A047713 Adjacent sequences: A047710 A047711 A047712 this_sequence A047714 A047715 
               A047716
%K A047713 nonn,nice
%O A047713 1,1
%A A047713 N. J. A. Sloane (njas(AT)research.att.com), Richard Pinch (rgep(AT)chalcedon.demon.co.uk) 
               and Robert G. Wilson v (rgwv(AT)rgwv.com)
%E A047713 Corrected by Eric Weisstein (eric(AT)weisstein.com); more terms from 
               David W. Wilson (davidwwilson(AT)comcast.net)