cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

Original entry on oeis.org

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
Offset: 1

Views

Author

Pierre CAMI, Dec 18 2008

Keywords

Examples

			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