login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A271221 Smallest Fermat pseudoprime k to all bases b = 2, 3, 4, ..., n. 3
341, 1105, 1105, 1729, 1729, 29341, 29341, 29341, 29341, 29341, 29341, 162401, 162401, 162401, 162401, 252601, 252601, 252601, 252601, 252601, 252601, 252601, 252601, 252601, 252601, 252601, 252601, 252601, 252601, 252601, 252601, 252601, 252601, 252601, 251601, 252601, 252601, 252601, 252601 (list; graph; refs; listen; history; text; internal format)
OFFSET

2,1

COMMENTS

a(n) is the smallest composite k such that b^(k-1) == 1 (mod (b-1)k) for every b = 2, 3, 4, ..., n. For more comments, see A083876 and A300629. - Max Alekseyev and Thomas Ordowski, Apr 29 2018

LINKS

Table of n, a(n) for n=2..40.

PROG

(PARI) a(n) = forcomposite(c=1, , my(i=0); for(b=2, n, if(Mod(b, c)^(c-1)==1, i++)); if(i==n-1, return(c)));

CROSSREFS

Cf. A052155, A083737, A083739, A083876, A300629.

Sequence in context: A179839 A172255 A087835 * A066488 A291601 A083876

Adjacent sequences:  A271218 A271219 A271220 * A271222 A271223 A271224

KEYWORD

nonn

AUTHOR

Felix Fröhlich, Apr 02 2016

EXTENSIONS

Edited by Thomas Ordowski, Apr 29 2018

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 27 21:52 EDT 2020. Contains 334671 sequences. (Running on oeis4.)