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 A269600 #5 Mar 01 2016 12:38:41 %S A269600 2,9,60,572,7030,105892,1886252,38768412,902743646,23482784400, %T A269600 674804472216,21227322458468,725465523386294,26765145874993234, %U A269600 1060182321437102136,44874027105660248520,2021234030434596074938 %N A269600 Number of length-n 0..n arrays with no repeated value differing from the previous repeated value by one or less. %C A269600 Diagonal of A269606. %H A269600 R. H. Hardin, <a href="/A269600/b269600.txt">Table of n, a(n) for n = 1..193</a> %e A269600 Some solutions for n=6 %e A269600 ..3. .2. .5. .1. .1. .3. .3. .1. .0. .6. .4. .5. .2. .3. .6. .4 %e A269600 ..4. .2. .6. .2. .4. .5. .5. .5. .3. .4. .2. .6. .3. .5. .0. .2 %e A269600 ..6. .0. .5. .0. .0. .6. .6. .4. .0. .2. .0. .2. .4. .1. .6. .0 %e A269600 ..3. .0. .6. .1. .4. .5. .3. .1. .1. .5. .0. .3. .2. .4. .6. .5 %e A269600 ..4. .3. .6. .6. .5. .3. .1. .3. .0. .0. .3. .5. .0. .6. .4. .3 %e A269600 ..1. .0. .3. .2. .4. .1. .5. .5. .3. .6. .3. .0. .1. .4. .1. .2 %Y A269600 Cf. A269606. %K A269600 nonn %O A269600 1,1 %A A269600 _R. H. Hardin_, Mar 01 2016