A098919 - OEIS

This site is supported by donations to The OEIS Foundation.

A098919

Least k such that k*M#(n) -1 is prime with M#(n)=product from 1 to n of Mersenne-primes.

2, 2, 2, 16, 2, 24, 8, 66, 6, 38, 44, 142, 116, 20, 460, 2974, 5774, 1110, 2520, 3422 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,1`
	EXAMPLE	`2(2^2-1)(2^3-1)*(2^5-1) - 1 = 1301 prime so k(3)=2`
	CROSSREFS	`Sequence in context: A129409 A025521 A068218 * A161748 A079007 A087238` `Adjacent sequences: A098916 A098917 A098918 * A098920 A098921 A098922`
	KEYWORD	`hard,more,nonn`
	AUTHOR	`Pierre CAMI (pierre-cami(AT)bbox.fr), Oct 17 2004`
	EXTENSIONS	`a(15)-a(20) from Donovan Johnson (donovan.johnson(AT)yahoo.com), Mar 23 2008`

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

Last modified February 15 05:45 EST 2012. Contains 205694 sequences.