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 A023190 #19 Nov 01 2021 00:43:55 %S A023190 1,2,2,3,4,4,5,5,6,6,7,6,7,8,8,9,10,10,11,10,11,12,12,12,13,14,13,14, %T A023190 15,15,16,16,16,17,17,18,18,18,19,19,20,20,21,21,21,22,22,23,23,23,24, %U A023190 24,24,24,24,25,25,26,26,26,27,27,27,28,28,29,29,29,30,30 %N A023190 Conjecturally, maximum number of primes in an infinitely-recurring prime pattern of width 2*n-1. %C A023190 Of all the patterns in A023192 (i.e. infinitely-recurring prime patterns) for length 2*n-1, consider those starting and ending with "p". This sequence gives the maximal count of "p"'s in any of those patterns. The companion sequence A023191, gives the number of patterns achieving that maximum. - _Sean A. Irvine_, May 27 2019 %H A023190 Martin Raab, <a href="/A023190/b023190.txt">Table of n, a(n) for n = 1..1166</a> %H A023190 Thomas J Engelsma, <a href="http://www.opertech.com/primes/k-tuples.html">Permissible Patterns</a> %e A023190 a(3) concerns patterns of length 5. Of the 10 potential patterns (ccccc, ccccp, cccpc, ccpcc, cpccc, pcccc, ccpcp, cpcpc, pcpcc, pcccp), only pcccp starts and ends with a "p", and it contains 2 "p"'s, so a(3) = 2, and A023191(3) = 1. - _Sean A. Irvine_, May 27 2019 %Y A023190 Cf. A023191, A023192. %K A023190 nonn %O A023190 1,2 %A A023190 _David W. Wilson_ %E A023190 More terms from Thomas J Engelsma web page added by _Martin Raab_, Oct 31 2021