id:A136027 - OEIS Search Results

Search: id:A136027

Displaying 1-1 of 1 results found.

page 1

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

+0
35

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

	OFFSET	`1,1`
	COMMENT	`The associated prime(k) are in A136026.`
	EXAMPLE	`a(1)=3 because 3 is smallest prime of the form (p-2)/3; in this case prime(k)=11.` `a(2)=3 because 3 is smallest prime of the form (p-4)/5; in this case prime(k)=19.` `a(3)=5 because 5 is smallest prime of the form (p-6)/7; in this case prime(k)=41.`
	MATHEMATICA	`a = {}; Do[k = 1; While[ !PrimeQ[(Prime[k] - 2n)/(2n + 1)], k++ ]; AppendTo[a, (Prime[k] - 2n)/(2n + 1)], {n, 1, 100}]; a`
	CROSSREFS	`Cf. A136019, A136020, A136026.` `Sequence in context: A087853 A095334 A071182 this_sequence A133772 A129972 A130829` `Adjacent sequences: A136024 A136025 A136026 this_sequence A136028 A136029 A136030`
	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 December 16 17:18 EST 2009. Contains 170825 sequences.

AT&T Labs Research