login
Conjecturally, number of infinitely-recurring prime patterns on n consecutive integers.
6

%I #11 May 27 2019 02:54:04

%S 2,3,5,7,10,13,19,25,35,45,59,73,101,129,170,211,268,325,430,535,695,

%T 855,1065,1275,1658,2041,2572,3103,3781,4459,5802,7145,9068,10991,

%U 13473,15955,20357,24759,30608,36457,44281,52105,66169,80233,98525,116817

%N Conjecturally, number of infinitely-recurring prime patterns on n consecutive integers.

%H Sean A. Irvine, <a href="/A023192/b023192.txt">Table of n, a(n) for n = 1..76</a>

%H Sean A. Irvine, <a href="https://github.com/archmageirvine/joeis/blob/master/src/irvine/oeis/a023/A023192.java">Java program</a> (github)

%e 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 Cf. A035326.

%K nonn

%O 1,1

%A _David W. Wilson_