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 A269770 #5 Mar 04 2016 14:37:38 %S A269770 2,9,64,620,7680,115920,2063880,42342912,983566800,25515160000, %T A269770 731128554024,22934195241984,781644611944014,28761550510694400, %U A269770 1136386416816000000,47984229920230342656,2156419762355192954760 %N A269770 Number of length-n 0..n arrays with every repeated value unequal to the previous repeated value plus one mod n+1. %C A269770 Diagonal of A269776. %H A269770 R. H. Hardin, <a href="/A269770/b269770.txt">Table of n, a(n) for n = 1..193</a> %e A269770 Some solutions for n=6 %e A269770 ..1. .4. .5. .2. .2. .1. .1. .3. .1. .0. .0. .2. .3. .0. .6. .4 %e A269770 ..2. .0. .2. .2. .2. .5. .1. .1. .1. .5. .4. .0. .4. .5. .2. .2 %e A269770 ..1. .6. .1. .0. .5. .1. .5. .2. .2. .0. .1. .2. .3. .4. .0. .1 %e A269770 ..1. .6. .5. .0. .6. .6. .3. .2. .6. .1. .6. .0. .6. .5. .2. .5 %e A269770 ..5. .5. .2. .2. .0. .6. .4. .5. .3. .4. .4. .1. .0. .4. .1. .5 %e A269770 ..4. .6. .6. .2. .0. .4. .3. .2. .3. .6. .1. .1. .2. .5. .4. .6 %Y A269770 Cf. A269776. %K A269770 nonn %O A269770 1,1 %A A269770 _R. H. Hardin_, Mar 04 2016