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 A254219 #10 Nov 03 2023 15:48:18 %S A254219 0,0,0,2,2,8,12,18,18,28,28,40,50,64,64,82,82,102,118,136,136,164,182, %T A254219 210,232,260,260,296,296,328,356,392,424,466,466,506,542,586,586,638, %U A254219 638,686,728,778,778,838,884,944,994,1050,1050,1118,1168,1236,1290,1352,1352 %N A254219 Number of length 2 1..(n+2) arrays with no leading or trailing partial sum equal to a prime and no consecutive values equal. %H A254219 Alois P. Heinz, <a href="/A254219/b254219.txt">Table of n, a(n) for n = 1..10000</a> (first 210 terms from R. H. Hardin) %e A254219 All solutions for n=4: %e A254219 ..6....4 %e A254219 ..4....6 %Y A254219 Row n=2 of A254218. %K A254219 nonn %O A254219 1,4 %A A254219 _R. H. Hardin_, Jan 26 2015