login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS").
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A092652 Number of consecutive prime runs of 6 primes congruent to 3 mod 4 below 10^n. 2
0, 0, 0, 0, 9, 140, 1354, 13190, 126026, 1190056, 11232733 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,5

LINKS

Table of n, a(n) for n=1..11.

FORMULA

Generate the prime sequence with primes labeled 1 mod 4 or 3 mod 4. Add count of primes to sequence if just 6 primes occur before interruption by a prime congruent to 1 mod 4.

EXAMPLE

a(5)=9 because 9 sets of 6 primes occur below 10^5, each run interrupted by a prime congruent to 1 mod 4.

CROSSREFS

Cf. A092651, A092653.

Sequence in context: A243673 A294117 A266634 * A137051 A137059 A263966

Adjacent sequences:  A092649 A092650 A092651 * A092653 A092654 A092655

KEYWORD

more,nonn

AUTHOR

Enoch Haga, Mar 02 2004

EXTENSIONS

a(9)-a(11) from Chai Wah Wu, Mar 18 2018

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 18 12:06 EST 2018. Contains 318229 sequences. (Running on oeis4.)