This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A373828 #7 Jun 23 2024 14:31:11
%S A373828 3,4,1,2,1,2,2,2,1,2,4,4,3,4,4,6,2,2,1,2,3,2,1,2,2,2,3,2,10,4,4,2,7,2,
%T A373828 4,2,3,2,2,2,1,2,2,2,18,6,2,2,2,2,17,4,1,4,2,2,6,2,9,2,3,2,1,2,1,2,1,
%U A373828 2,8,2,3,2,2,4,15,2,1,2,4,2,1,2,1,2,7,2
%N A373828 Run-sums (differing by 0) of run-lengths (differing by 2) of odd primes.
%C A373828 Run-sums of A251092.
%e A373828 The odd primes are:
%e A373828 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, ...
%e A373828 with runs:
%e A373828 {3,5,7}, {11,13}, {17,19}, {23}, {29,31}, {37}, {41,43}, {47}, {53}, ...
%e A373828 with lengths:
%e A373828 3, 2, 2, 1, 2, 1, 2, 1, 1, 2, 1, 2, 1, 1, 1, 1, 2, 2, 1, 1, 1, 2, 2, ...
%e A373828 with runs:
%e A373828 {3}, {2,2}, {1}, {2}, {1}, {2}, {1,1}, {2}, {1}, {2}, {1,1,1,1}, {2,2}, ...
%e A373828 with sums a(n).
%t A373828 Total/@Split[Length /@ Split[Select[Range[3,10000],PrimeQ], #1+2==#2&]//Most]//Most
%Y A373828 Run-sums of A251092.
%Y A373828 The run-lengths (instead of run-sums) are A373819, firsts A373825, A373824.
%Y A373828 A000040 lists the primes.
%Y A373828 A001223 gives first differences of primes.
%Y A373828 A027833 gives antirun-lengths of primes > 3 (prepended run-lengths A373820).
%Y A373828 A046933 counts composite numbers between primes.
%Y A373828 A071148 gives partial sums of odd primes.
%Y A373828 A333254 gives run-lengths of first differences of primes.
%Y A373828 A373821 gives run-lengths of run-lengths of first differences of odd primes.
%Y A373828 Cf. A006560, A006562, A029707, A054265, A067774, A373403, A373404, A373406.
%K A373828 nonn
%O A373828 1,1
%A A373828 _Gus Wiseman_, Jun 23 2024