The On-Line Encyclopedia of Integer Sequences (OEIS)

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

Revision History for A326614

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A326614

Smallest Euler-Jacobi pseudoprime to base n.
(history; published version)

#25 by Peter Luschny at Fri Jul 19 15:02:20 EDT 2019

STATUS

reviewed

approved

#24 by Rémy Sigrist at Fri Jul 19 14:40:20 EDT 2019

STATUS

proposed

reviewed

#23 by Rémy Sigrist at Fri Jul 19 14:40:11 EDT 2019

STATUS

editing

proposed

#22 by Rémy Sigrist at Fri Jul 19 14:39:55 EDT 2019

CROSSREFS

Cf. A047713, A048950, A090086 (least Fermat pseudoprime to base n), A298756 (least strong pseudoprime to base n).

STATUS

proposed

editing

Discussion

Fri Jul 19

14:40

Rémy Sigrist: added two to

#21 by Richard N. Smith at Tue Jul 16 06:39:35 EDT 2019

STATUS

editing

proposed

#20 by Wesley Ivan Hurt at Tue Jul 16 06:21:24 EDT 2019

STATUS

proposed

editing

#19 by Michel Marcus at Mon Jul 15 13:35:18 EDT 2019

STATUS

editing

proposed

Discussion

Tue Jul 16

01:29

Richard N. Smith: a(x) = 9 for x in A056020
not only for this sequence, but also for A090086 and A298756

#18 by Michel Marcus at Mon Jul 15 13:35:11 EDT 2019

PROG

(PARI) isok(k, n) = ((k%2==1) && (gcd(k, n)==1) && Mod(n, k)^((k-1)/2)==kronecker(n, k) && !isprime(k));

a(n) = my(k=2); while (! isok(k, n), k++); k; \\ Michel Marcus, Jul 15 2019

STATUS

proposed

editing

#17 by Amiram Eldar at Mon Jul 15 05:29:48 EDT 2019

STATUS

editing

proposed

#16 by Amiram Eldar at Mon Jul 15 05:29:15 EDT 2019

MATHEMATICA

ejpspQ[n_, b_] := CoprimeQ[n, b] && CompositeQ[n] && Mod[b^((n - 1)/2) - JacobiSymbol[b, n], n] == 0; leastEJpsp[b_] := Module[{k=9}, While[!ejpspQ[k, b], k+=2]; k]; Array[leastEJpsp, 100] (* Amiram Eldar, Jul 15 2019 *)

STATUS

proposed

editing