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

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A101406 a(n) = least k such that k^n*(k^n-1)-1 is prime. 7
 3, 2, 3, 2, 2, 3, 3, 19, 2, 2, 45, 7, 15, 7, 5, 5, 44, 2, 4, 3, 84, 62, 128, 5, 4, 90, 16, 37, 15, 11, 311, 15, 295, 72, 3, 3, 242, 2, 126, 64, 152, 11, 78, 26, 2, 13, 14, 26, 140, 2, 24, 16, 157, 4, 49, 13, 2, 123, 64, 16, 61, 206, 6, 76, 412, 31, 84, 23, 24, 9, 471, 26, 422, 227, 8 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Under the Bunyakovsky conjecture, a(n) exists for every n. [Charles R Greathouse IV, Dec 27 2011] LINKS Pierre CAMI, Table of n, a(n) for n = 1..700 EXAMPLE 2^5*(2^5-1) - 1 = 32*31 - 1 = 991 (prime) so for n=5 a(5)=2. MATHEMATICA a = {}; Do[ k = 1; While[c = k^n; t = c*(c - 1) - 1; ! PrimeQ[t], k++ ]; AppendTo[a, k]; , {n, 75}]; a (* Ray Chandler, Jan 27 2005 *) CROSSREFS Cf. A101446. Sequence in context: A056564 A082844 A279124 * A245219 A097509 A095206 Adjacent sequences:  A101403 A101404 A101405 * A101407 A101408 A101409 KEYWORD nonn AUTHOR Pierre CAMI, Jan 24 2005 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 January 18 13:49 EST 2020. Contains 331010 sequences. (Running on oeis4.)