id:A146524 - OEIS Search Results

Search: id:A146524

Displaying 1-1 of 1 results found.

page 1

a(n) is the largest nonnegative integer m such that 2*n*k+1 is prime for all k where 1<=k<=m. a(n) = 0 if 2n+1 is composite.

+0
2

3, 1, 3, 0, 1, 1, 0, 1, 2, 0, 1, 0, 0, 1, 2, 0, 0, 3, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 2, 0, 1, 0, 0, 1, 0, 0, 0, 2, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 2, 0, 0, 0, 0, 1, 1, 0, 0, 2, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 2, 0, 0, 0, 0, 0, 3 (list; graph; listen)

	OFFSET	`1,1`
	LINKS	`Leroy Quet, Home Page (listed in lieu of email address)`
	EXAMPLE	`For n = 3: 231 +1 = 7, which is prime. 232 + 1 = 13, which is prime. 233 + 1 = 19, which is prime. But 234 + 1 = 25, which is composite. So, a(3) = 3, because there are 3 primes in the arithmetic sequence before hitting a composite.`
	CROSSREFS	`A146525` `Sequence in context: A126038 A088363 A143783 this_sequence A167274 A131088 A136157` `Adjacent sequences: A146521 A146522 A146523 this_sequence A146525 A146526 A146527`
	KEYWORD	`nonn`
	AUTHOR	`Leroy Quet Oct 30 2008`
	EXTENSIONS	`Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Nov 01 2008`

page 1

Search completed in 0.011 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research