id:A103961 - OEIS Search Results

Search: id:A103961

Displaying 1-1 of 1 results found.

page 1

Least k such that 2*n*k - 1 is a prime.

+0
1

2, 1, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 4, 3, 1, 1, 2, 2, 1, 2, 1, 1, 3, 1, 3, 2, 1, 3, 3, 1, 1, 2, 2, 1, 2, 1, 1, 2, 3, 1, 2, 1, 3, 3, 1, 4, 3, 2, 1, 2, 1, 1, 2, 1, 1, 2, 1, 3, 3, 2, 4, 5, 2, 1, 3, 1, 3, 2, 1, 1, 2, 3, 7, 3, 1, 1, 2, 2, 1, 3, 4, 1, 2, 1, 3, 5, 1, 7, 8, 1, 1, 2, 3, 3, 2, 1, 1, 3, 1, 1, 5, 5, 3, 5, 2 (list; graph; listen)

	OFFSET	`1,1`
	EXAMPLE	`212-1=3, so a(1)=2;` `252-1=19, so a(5)=2`
	MATHEMATICA	`Do[k = 1; cp = nk - 1; While[ ! PrimeQ[cp], k++; cp = nk - 1]; Print[k], {n, 2, 400, 2}]`
	CROSSREFS	`Cf. A016014.` `Sequence in context: A128257 A106035 A105141 this_sequence A071891 A046072 A072273` `Adjacent sequences: A103958 A103959 A103960 this_sequence A103962 A103963 A103964`
	KEYWORD	`easy,nonn`
	AUTHOR	`Lei Zhou (lzhou5(AT)emory.edu), Feb 23 2005`

page 1

Search completed in 0.002 seconds

Last modified December 20 16:54 EST 2009. Contains 171081 sequences.

AT&T Labs Research