This site is supported by donations to The OEIS Foundation.

 Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS". Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A135279 Smallest k such that x^k is (+1 or -1) mod p for all nonzero x relatively prime to p, where p=prime(n)=A000040(n). 0
 1, 2, 2, 3, 5, 6, 8, 9, 11, 14, 15 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS FORMULA maybe a(1)=1 a(2)=2, a(n)=f(n-1) where f is A005097. EXAMPLE a(6)=6 because X^6 (mod 13) is +-1. CROSSREFS Cf. A002322, A005097. Sequence in context: A236970 A060966 A172993 * A035631 A050046 A052337 Adjacent sequences:  A135276 A135277 A135278 * A135280 A135281 A135282 KEYWORD more,nonn AUTHOR Masahiko Shin, Dec 02 2007 EXTENSIONS Edited by R. J. Mathar, Jan 30 2008 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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.