id:A153095 - OEIS Search Results

Search: id:A153095

Displaying 1-1 of 1 results found.

page 1

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

+0
2

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; listen)

	OFFSET	`1,1`
	LINKS	`Pierre CAMI, Table of n, a(n) for n = 1..1000`
	EXAMPLE	`12^1(2^1-1)+1=3 prime so m(1)=2 12^2(2^2-1)-1=11 as 13 so m(2)=2 12^3(2^3-1)-1=55 composite 12^3(2^3-1)+1=57 composite 13^3(3^3-1)-1=71 prime as 73 so m(3)=3`
	CROSSREFS	`A152414, A152090, A152091, A152092, A152093, A152094` `Sequence in context: A136032 A140361 A155940 this_sequence A054483 A108939 A138143` `Adjacent sequences: A153092 A153093 A153094 this_sequence A153096 A153097 A153098`
	KEYWORD	`nonn`
	AUTHOR	`Pierre CAMI (pierre-cami(AT)orange.fr), Dec 18 2008`

page 1

Search completed in 0.002 seconds

Last modified November 24 23:16 EST 2009. Contains 167481 sequences.

AT&T Labs Research