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 A023192 #16 Aug 25 2025 10:18:47
%S A023192 2,3,5,7,10,13,19,25,35,45,59,73,101,129,170,211,268,325,430,535,695,
%T A023192 855,1065,1275,1658,2041,2572,3103,3781,4459,5802,7145,9068,10991,
%U A023192 13473,15955,20357,24759,30608,36457,44281,52105,66169,80233,98525,116817,140798,164779
%N A023192 Conjecturally, number of infinitely-recurring prime patterns on n consecutive integers.
%H A023192 Pontus von Brömssen, <a href="/A023192/b023192.txt">Table of n, a(n) for n = 1..120</a> (terms 1..76 from Sean A. Irvine)
%H A023192 Sean A. Irvine, <a href="https://github.com/archmageirvine/joeis/blob/master/src/irvine/oeis/a023/A023192.java">Java program</a> (github)
%F A023192 a(n) = 1 + Sum_{k=1..floor((n+1)/2)} (n-2*k+2)*A023189(k). - _Pontus von Brömssen_, Aug 25 2025
%e A023192 a(3) = 5: Conjecturally, there are five infinitely-recurring prime patterns of length 3. These are "ccc" (three composites in a row), "ccp", "cpc", "pcc" and "pcp". Others, like "ppc", starting at 2, only occur a finite number of times.
%Y A023192 Cf. A023189, A035326.
%K A023192 nonn,changed
%O A023192 1,1
%A A023192 _David W. Wilson_