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!)
A354692 Smallest Euler-Jacobi pseudoprime to all natural bases up to prime(n) - 1 that is not a base prime(n) Euler-Jacobi pseudoprime. 0
9, 561, 10585, 1729, 488881, 399001, 2433601, 1857241, 6189121, 549538081, 50201089, 14469841, 86566959361, 311963097601, 369838909441, 31929487861441, 6389476833601, 8493512837546881, 31585234281457921, 10120721237827201, 289980482095624321, 525025434548260801, 91230634325542321 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
An Euler-Jacobi pseudoprime to the base b is an odd composite number k such that gcd(b, k) = 1 and the Jacobi symbol (.,.) satisfies b^((k-1)/2) == (b,k) (mod k).
a(n) is coprime to A002110(n-1).
a(24) > 2^64. - Daniel Suteu, Jun 05 2022
LINKS
Eric Weisstein's World of Mathematics, Euler-Jacobi Pseudoprime.
PROG
(PARI) a(n) = my(b, p=factorback(primes(n-1))); forcomposite(k=9, oo, if(gcd(k, p)==1, b=2; while(Mod(b, k)^(k\2) == kronecker(b, k), b++); if(b==prime(n), return(k))));
CROSSREFS
Sequence in context: A267548 A326614 A007324 * A347844 A291910 A074731
KEYWORD
nonn
AUTHOR
Jinyuan Wang, Jun 03 2022
EXTENSIONS
a(13)-a(23) from Daniel Suteu, Jun 05 2022
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 April 16 08:15 EDT 2024. Contains 371698 sequences. (Running on oeis4.)