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

 


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<m(n)<10
2

%I #5 Mar 31 2012 13:22:06

%S 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,

%T 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,

%U 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

%N 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<m(n)<10

%H Pierre CAMI, <a href="/A153095/b153095.txt">Table of n, a(n) for n = 1..1000</a>

%e 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

%Y A152414, A152090, A152091, A152092, A152093, A152094

%K nonn

%O 1,1

%A _Pierre CAMI_, Dec 18 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | 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 September 21 08:40 EDT 2024. Contains 376083 sequences. (Running on oeis4.)