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 A023191 #19 Nov 01 2021 00:44:07 %S A023191 1,1,1,2,1,1,2,2,1,4,2,10,14,3,2,4,2,1,2,11,2,2,6,9,6,2,12,14,4,2,2, %T A023191 10,2,4,8,2,12,8,4,12,2,2,2,2,6,4,20,2,24,14,4,4,2,6,92,18,8,2,18,12, %U A023191 8,32,8,10,10,2,12,30,2,10,2,70,46,4,4,88,14,30,20 %N A023191 Conjecturally, number of maximal infinitely-recurring prime patterns of width 2*n-1. %C A023191 See explanation in A023190. - _Sean A. Irvine_, May 27 2019 %H A023191 Martin Raab, <a href="/A023191/b023191.txt">Table of n, a(n) for n = 1..1166</a> %H A023191 Thomas J Engelsma, <a href="http://www.opertech.com/primes/k-tuples.html">Permissible Patterns</a> %K A023191 nonn %O A023191 1,4 %A A023191 _David W. Wilson_ %E A023191 More terms from Thomas J Engelsma web page added by _Martin Raab_, Oct 31 2021