A153094 Least k(n) such that k(n)*m^n*(m^n-1)+j is prime with j= -1 or 1 or both and 1<m<10

1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4, 1, 2, 1, 1, 1, 4, 1, 1, 1, 3, 5, 2, 1, 1, 3, 2, 2, 2, 9, 6, 1, 6, 4, 1, 1, 4, 1, 2, 2, 3, 6, 6, 5, 1, 5, 5, 1, 2, 1, 10, 3, 5, 1, 3, 2, 1, 4, 5, 2, 2, 3, 1, 1, 2, 3, 5, 5, 6, 1, 12, 3, 5, 6, 1, 2, 9, 3, 4, 1, 1, 5, 2, 3, 4, 7, 2, 2, 16, 8, 5, 1, 5, 5, 6, 3, 2, 11, 2, 2

Offset

1,11

Comments

when n increases sum k(n) for i=1 to n / sum n for i=1 to n tends to 0.05, 0<k(n)<0.5*n

Links

Pierre CAMI, Table of n, a(n) for n = 1..1000

Example

1*2^1*(2^1-1)+1=3 prime so k(1)=1

Crossrefs

A152414, A152090, A152091, A152092, A152093, A152095

Sequence in context: A079163 A108536 A232631 * A144870 A370211 A256252

Adjacent sequences: A153091 A153092 A153093 * A153095 A153096 A153097

Keyword

nonn

Author

Pierre CAMI, Dec 18 2008

Status

approved