id:A088573 - OEIS Search Results

Search: id:A088573

Displaying 1-1 of 1 results found.

page 1

Smallest m such that {n+k*(n-1): 0<k<=m} contains exactly as many primes as <= n.

+0
1

1, 1, 2, 3, 6, 7, 5, 15, 10, 11, 9, 29, 12, 33, 13, 15, 21, 35, 14, 57, 20, 25, 27, 43, 18, 45, 22, 29, 26, 59, 19, 81, 35, 39, 29, 65, 27, 87, 41, 47, 39, 89, 24, 95, 52, 55, 42, 103, 36, 117, 37, 59, 48, 131, 36, 89, 49, 85, 68, 109, 38, 131, 67, 85, 69, 103, 45 (list; graph; listen)

	OFFSET	`1,3`
	COMMENT	`#{p prime: p=n+k*(n-1) and 0<k<=a(n)} = A000720(n).`
	LINKS	`Index entries for sequences related to primes in arithmetic progressions` `Eric Weisstein's World of Mathematics, Dirichlet's Theorem`
	EXAMPLE	`n=7: #{primes<=7} = #{2,3,5,7} = 4, first 4 primes of the form` `7+k(7-1): 13=7+16, 19=7+26, 31=7+46 and 37=7+5*6: a(7)=5.`
	CROSSREFS	`Sequence in context: A001058 A114462 A092569 this_sequence A126388 A039247 A039189` `Adjacent sequences: A088570 A088571 A088572 this_sequence A088574 A088575 A088576`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Nov 18 2003`

page 1

Search completed in 0.002 seconds

Last modified November 24 19:42 EST 2009. Contains 167435 sequences.

AT&T Labs Research