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!)
A273339 Smallest composite c such that n^(c-1) =/= 1 (mod c^2), i.e., smallest composite c that is not a "Wieferich pseudoprime" to base n. 3
4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 4, 4 (list; graph; refs; listen; history; text; internal format)
OFFSET
2,1
COMMENTS
Smallest composite c such that n does not occur in row c of the array in A244752. - Felix Fröhlich, Jan 07 2017
LINKS
PROG
(PARI) a(n) = forcomposite(c=1, , if(Mod(n, c^2)^(c-1)!=1, return(c)))
CROSSREFS
Sequence in context: A138908 A032564 A141248 * A088899 A258199 A290205
KEYWORD
nonn
AUTHOR
Felix Fröhlich, May 20 2016
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 25 11:36 EDT 2024. Contains 371968 sequences. (Running on oeis4.)