%I A092643
%S A092643 0,0,1,36,323,2480,20947,183898
%N A092643 Number of consecutive prime runs of 3 primes congruent to 3 mod 4 below 
               10^n.
%F A092643 Generate the prime sequence with primes labeled 1 mod 4 or 3 mod 4. Add 
               count of primes to sequence if just 3 primes occur before interruption 
               by a prime congruent to 1 mod 4.
%e A092643 a(5)=323 because 323 sets of 3 primes occur below 10^5, each run interrupted 
               by a prime congruent to 1 mod 4.
%Y A092643 Cf. A092642 A092644.
%Y A092643 Sequence in context: A017462 A067741 A073972 this_sequence A045786 A017594 
               A014800
%Y A092643 Adjacent sequences: A092640 A092641 A092642 this_sequence A092644 A092645 
               A092646
%K A092643 easy,more,nonn
%O A092643 1,4
%A A092643 Enoch Haga (Enokh(AT)comcast.net), Mar 02 2004