cp's OEIS Frontend

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

%I A153095 #7 Jun 02 2025 01:16:04
%S A153095 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 A153095 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 A153095 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 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<m(n)<10.
%H A153095 Pierre CAMI, <a href="/A153095/b153095.txt">Table of n, a(n) for n = 1..1000</a>
%e A153095 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 A153095 A152414, A152090, A152091, A152092, A152093, A152094
%K A153095 nonn
%O A153095 1,1
%A A153095 _Pierre CAMI_, Dec 18 2008