A098872 - OEIS

This site is supported by donations to The OEIS Foundation.

A098872

Least k such that 2*((6*n)^k) + 1 is prime.

1, 3, 1, 2, 1, 1, 2, 1, 1, 3, 2, 2, 1, 4, 1, 1, 2, 5, 1, 1, 4, 2, 1, 5, 3, 1, 2, 1, 1, 8, 1, 3, 1, 1, 1, 1, 66, 1, 6, 2, 3, 3, 5, 2, 1, 4, 7, 1, 9, 1, 1, 3, 6, 2, 1, 1, 96, 4, 1, 2, 1, 62, 1, 1, 9, 5, 159, 4, 1, 7, 1, 4, 1, 8, 2, 2, 2, 1, 2, 8, 2, 2, 1, 1, 1, 1, 54, 8, 1, 5, 1, 16, 1, 1, 2, 1, 7, 2, 4, 1, 1 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,2`
	EXAMPLE	`2((61)^1) + 1 = 13 prime, so a(1)=1` `2((62)^1) + 1 = 25 = 5^2` `2((62)^2) + 1 = 289 = 17^2` `2((62)^3) + 1 = 3457 prime, so a(2)=3`
	CROSSREFS	`Sequence in context: A176511 A016569 A072801 * A167366 A139436 A205555` `Adjacent sequences: A098869 A098870 A098871 * A098873 A098874 A098875`
	KEYWORD	`nonn`
	AUTHOR	`Pierre CAMI (pierre-cami(AT)bbox.fr), Oct 13 2004`
	EXTENSIONS	`Extended by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Nov 13 2009`

Content is available under The OEIS End-User License Agreement .

Last modified February 16 03:44 EST 2012. Contains 205860 sequences.