The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A153095 Least m(n) such that k(n)*m(n)^n*(m(n)^n-1)+j is prime with j= -1 or 1 or both and least possible k(n) with 1
 2, 2, 3, 2, 2, 3, 3, 5, 2, 2, 2, 3, 8, 7, 5, 4, 2, 2, 4, 3, 6, 2, 2, 5, 4, 7, 6, 4, 3, 2, 2, 2, 2, 6, 3, 3, 7, 2, 2, 2, 5, 2, 2, 3, 2, 2, 2, 5, 7, 2, 9, 5, 4, 4, 2, 2, 2, 8, 7, 4, 8, 4, 6, 5, 4, 5, 5, 4, 3, 9, 2, 2, 6, 3, 8, 8, 4, 2, 4, 8, 6, 2, 2, 4, 4, 5, 6, 4, 4, 8, 4, 6, 4, 7, 3, 4, 6, 7, 5, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Pierre CAMI, Table of n, a(n) for n = 1..1000 EXAMPLE 1*2^1*(2^1-1)+1=3 prime so m(1)=2 1*2^2*(2^2-1)-1=11 as 13 so m(2)=2 1*2^3*(2^3-1)-1=55 composite 1*2^3*(2^3-1)+1=57 composite 1*3^3*(3^3-1)-1=71 prime as 73 so m(3)=3 CROSSREFS A152414, A152090, A152091, A152092, A152093, A152094 Sequence in context: A362816 A176208 A330623 * A254574 A306991 A239585 Adjacent sequences: A153092 A153093 A153094 * A153096 A153097 A153098 KEYWORD nonn AUTHOR Pierre CAMI, Dec 18 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 12 22:48 EDT 2024. Contains 371639 sequences. (Running on oeis4.)