id:A091267 - OEIS Search Results

Search: id:A091267

Displaying 1-1 of 1 results found.

page 1

Lengths of runs of 3's in A039702.

+0
4

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

	OFFSET	`1,2`
	COMMENT	`Number of primes congruent to 3 mod 4 in sequence before interruption by a prime 1 mod 4.`
	REFERENCES	`Enoch Haga, Exploring prime numbers on your PC and the Internet with directions to prime number sites on the Internet, 2001, pages 30-31. ISBN 1-885794-17-7.`
	FORMULA	`Count primes congruent to 3 mod 4 in sequence before interruption by a prime divided by 4 with remainder 1.`
	EXAMPLE	`a(16)=4 because this is the sequence of primes congruent to 3 mod 4: 199, 211, 223, 227. The next prime is 229, a prime 1 mod 4.`
	CROSSREFS	`Cf. A002144, A002145, A091318, A039702, A091237.` `Sequence in context: A119469 A127439 A092788 this_sequence A003643 A058062 A102820` `Adjacent sequences: A091264 A091265 A091266 this_sequence A091268 A091269 A091270`
	KEYWORD	`easy,nonn`
	AUTHOR	`Enoch Haga (Enokh(AT)comcast.net), Feb 22 2004`

page 1

Search completed in 0.002 seconds

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.

AT&T Labs Research