id:A136019 - OEIS Search Results

Search: id:A136019

Displaying 1-1 of 1 results found.

page 1

Smallest prime of the form (prime(k)+2*n)/(2*n+1), any k.

+0
56

3, 3, 5, 3, 3, 5, 3, 7, 11, 3, 3, 5, 5, 3, 11, 3, 3, 5, 3, 3, 5, 5, 7, 5, 3, 3, 7, 5, 13, 7, 3, 3, 5, 3, 13, 5, 3, 7, 5, 3, 3, 13, 5, 3, 7, 5, 3, 5, 3, 7, 7, 3, 7, 11, 3, 3, 5, 11, 3, 7, 7, 3, 5, 11, 3, 13, 3, 7, 5, 3, 7, 11, 7, 13, 7, 3, 3, 11, 23, 7, 5, 3, 31, 5, 13, 3, 5, 5, 3, 7, 3, 13, 7, 3, 3, 5, 7 (list; graph; listen)

	OFFSET	`1,1`
	COMMENT	`The associated prime(k) are in A136020.`
	EXAMPLE	`a(1)=3 because 3 is smallest prime of the form (p+2)/3; in this case prime(k)=7.` `a(2)=3 because 3 is smallest prime of the form (p+4)/5; in this case prime(k)=11.` `a(3)=5 because 5 is smallest prime of the form (p+6)/7; in this case prime(k)=29.`
	MATHEMATICA	`a = {}; Do[k = 1; While[ !PrimeQ[(Prime[k] + 2n)/(2n + 1)], k++ ]; AppendTo[a, (Prime[k] + 2n)/(2n + 1)], {n, 1, 200}]; a`
	CROSSREFS	`Cf. A136020, A136026, A136027.` `Sequence in context: A054906 A020483 A138479 this_sequence A063714 A113965 A162277` `Adjacent sequences: A136016 A136017 A136018 this_sequence A136020 A136021 A136022`
	KEYWORD	`nonn,easy`
	AUTHOR	`Artur Jasinski (grafix(AT)csl.pl), Dec 10 2007`
	EXTENSIONS	`Edited by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), May 17 2009`

page 1

Search completed in 0.002 seconds

Last modified November 22 15:28 EST 2009. Contains 167310 sequences.

AT&T Labs Research