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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A074485 Bases n for which the smallest (Fermat) pseudoprime greater than n has Moebius function mu = -1. 2
 41, 49, 71, 83, 97, 104, 111, 148, 155, 157, 161, 163, 164, 167, 169, 181, 190, 194, 197, 205, 209, 223, 227, 229, 230, 231, 239, 243, 254, 265, 269, 272, 277, 284, 323, 331, 341, 344, 348, 351, 353, 355, 356, 358, 371, 373, 379, 383, 384, 388, 391, 395 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Charles R Greathouse IV, Table of n, a(n) for n = 1..10000 EXAMPLE 41: Its smallest pseudoprime is 105 = 3 * 5 * 7 and mu (105) = -1 <= (105 > 41). 49: Its smallest pseudoprime is 66 = 2 * 3 * 11 and mu (66) = -1 <= (66 > 49). 71: Its smallest pseudoprime is 105 = 3 * 5 * 7 and mu (105) = -1 <= (105 > 71). PROG (PARI) is(n)=my(k=n+1); while(isprime(k)||Mod(n, k)^(k-1)!=1, k++); moebius(k)<0 \\ Charles R Greathouse IV, Aug 22 2013 CROSSREFS Cf. A007535, A074228. Sequence in context: A043931 A139219 A185658 * A039383 A043206 A043986 Adjacent sequences:  A074482 A074483 A074484 * A074486 A074487 A074488 KEYWORD easy,nonn AUTHOR Jani Melik, Sep 25 2002 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.

Last modified December 7 13:08 EST 2021. Contains 349581 sequences. (Running on oeis4.)