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 A269773 #8 Jan 29 2019 05:25:03 %S A269773 6,36,216,1290,7680,45600,270150,1597500,9432000,55616250,327585000, %T A269773 1927725000,11335143750,66607312500,391177125000,2296246406250, %U A269773 13473738750000,79033031250000,463449377343750,2716989679687500 %N A269773 Number of length-n 0..5 arrays with every repeated value unequal to the previous repeated value plus one mod 5+1. %H A269773 R. H. Hardin, <a href="/A269773/b269773.txt">Table of n, a(n) for n = 1..210</a> %F A269773 Empirical: a(n) = 10*a(n-1) - 20*a(n-2) - 25*a(n-3). %F A269773 Empirical g.f.: 6*x*(1 - 4*x - 4*x^2) / ((1 - 5*x)*(1 - 5*x - 5*x^2)). - _Colin Barker_, Jan 29 2019 %e A269773 Some solutions for n=6: %e A269773 ..0. .2. .2. .1. .4. .1. .4. .0. .4. .2. .0. .3. .4. .3. .5. .4 %e A269773 ..4. .2. .3. .5. .4. .1. .2. .5. .1. .0. .1. .0. .0. .5. .4. .3 %e A269773 ..5. .4. .0. .4. .3. .0. .5. .4. .1. .3. .1. .0. .2. .3. .5. .4 %e A269773 ..3. .4. .5. .4. .3. .4. .1. .5. .0. .1. .2. .1. .3. .5. .5. .2 %e A269773 ..1. .2. .1. .0. .2. .1. .5. .3. .1. .3. .3. .3. .0. .1. .3. .2 %e A269773 ..4. .3. .2. .1. .3. .0. .0. .3. .4. .4. .3. .2. .2. .1. .4. .1 %Y A269773 Column 5 of A269776. %K A269773 nonn %O A269773 1,1 %A A269773 _R. H. Hardin_, Mar 04 2016