id:A048198 - OEIS Search Results

Search: id:A048198

Displaying 1-1 of 1 results found.

page 1

Number of primes between successive n's, where n mod 10 = 5.

+0
3

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

	OFFSET	`0,1`
	COMMENT	`A way to visualize the distribution of primes without the clutter of the numbers themselves. Consecutive 0's indicate stretches where there are no primes. Other patterns become obvious, as a string of 2's or 1's.`
	FORMULA	`Starting at 0, count primes between 0-5, 5-15, 15-25, etc.`
	EXAMPLE	`Between n's 115 and 125 there are no primes, indicated by the entry 0.`
	CROSSREFS	`Cf. A048199.` `Sequence in context: A030423 A130631 A130633 this_sequence A096006 A131294 A102313` `Adjacent sequences: A048195 A048196 A048197 this_sequence A048199 A048200 A048201`
	KEYWORD	`easy,nonn`
	AUTHOR	`Enoch Haga (Enokh(AT)comcast.net)`

page 1

Search completed in 0.002 seconds

Last modified December 9 18:50 EST 2009. Contains 170568 sequences.

AT&T Labs Research