login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A375490 Odd numbers k > 1 such that gcd(3,k) = 1 and 3^((k-1)/2) == -(3/k) (mod k), where (3/k) is the Jacobi symbol (or Kronecker symbol); Euler pseudoprimes to base 3 (A262051) that are not Euler-Jacobi pseudoprimes to base 3 (A048950). 0
1541, 2465, 4961, 30857, 31697, 72041, 83333, 162401, 192713, 206981, 258017, 359369, 544541, 565001, 574397, 653333, 929633, 1018601, 1032533, 1133441, 1351601, 1373633, 1904033, 1953281, 2035661, 2797349, 2864501, 3264797, 3375041, 3554633, 3562361, 3636161 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Note that if b^((k-1)/2) == -(b/k) (mod k), then taking Jacobi symbol modulo k (which depends only on the remainder modulo k) yields (b/k)^((k-1)/2) = -(b/k), or (b/k)^((k+1)/2) = -1. This implies that (k+1)/2 is odd, so k == 1 (mod 4).
Conjecture: In general, if k > 1 is odd and b^((k-1)/2) == -(b/k) (mod k), then (b/k) = -1. Under this conjecture, this sequence is equivalent to "Numbers k == 5 (mod 12) such that 3^((k-1)/2) == 1 (mod k)".
LINKS
EXAMPLE
1541 is a term because (3/1541) = -1, and 3^((1541-1)/2) == 1 (mod 1541).
PROG
(PARI) isA375490(k) = (k>1) && gcd(k, 6)==1 && Mod(3, k)^((k-1)/2)==-kronecker(3, k)
CROSSREFS
| b=2 | b=3 | b=5 |
-----------------------------------+-------------------+----------+---------+
(b/k)=1, b^((k-1)/2)==1 (mod k) | A006971 | A375917 | A375915 |
-----------------------------------+-------------------+----------+---------+
(b/k)=-1, b^((k-1)/2)==-1 (mod k) | A244628 U A244626 | A375918 | A375916 |
-----------------------------------+-------------------+----------+---------+
b^((k-1)/2)==-(b/k) (mod k), | | | |
conjectured to be also | A306310 | this seq | A375816 |
(b/k)=-1, b^((k-1)/2)==1 (mod k) | | | |
-----------------------------------+-------------------+----------+---------+
Euler-Jacobi pseudoprimes | A047713 | A048950 | A375914 |
(union of first two) | | | |
-----------------------------------+-------------------+----------+---------+
Euler pseudoprimes | A006970 | A262051 | A262052 |
(union of all three) | | | |
Sequence in context: A092717 A203134 A083734 * A137598 A252966 A133560
KEYWORD
nonn,new
AUTHOR
Jianing Song, Sep 01 2024
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 3 10:23 EDT 2024. Contains 375657 sequences. (Running on oeis4.)