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 A267464 #5 Jan 15 2016 15:22:16 %S A267464 2,9,58,515,5921,83972,1418740,27838701,622347697,15615978774, %T A267464 434592601906,13284763035843,442468160695185,15948347001674856, %U A267464 618492693332510536,25678060436644303705,1136319246969590031009 %N A267464 Number of length-n 0..n arrays with no following elements larger than the first repeated value. %C A267464 Diagonal of A267471. %H A267464 R. H. Hardin, <a href="/A267464/b267464.txt">Table of n, a(n) for n = 1..210</a> %e A267464 Some solutions for n=6 %e A267464 ..2....0....2....5....0....2....5....2....3....2....2....0....5....4....0....5 %e A267464 ..5....5....5....2....3....5....6....1....6....3....1....1....3....1....4....4 %e A267464 ..3....1....2....0....0....3....1....3....2....2....3....3....5....4....1....0 %e A267464 ..4....2....5....3....3....4....3....1....0....5....5....5....3....4....3....6 %e A267464 ..2....5....6....0....5....3....2....3....2....6....0....5....3....3....6....5 %e A267464 ..2....5....4....5....6....4....3....6....2....0....1....1....1....0....3....2 %Y A267464 Cf. A267471. %K A267464 nonn %O A267464 1,1 %A A267464 _R. H. Hardin_, Jan 15 2016