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 A269774 #7 Jan 29 2019 05:32:41 %S A269774 7,49,343,2394,16674,115920,804636,5577768,38621016,267152256, %T A269774 1846396944,12751839072,88012679328,607126689792,4186073691072, %U A269774 28850627143296,198768754154880,1369007582681088,9426405790368000,64890966854407680 %N A269774 Number of length-n 0..6 arrays with every repeated value unequal to the previous repeated value plus one mod 6+1. %H A269774 R. H. Hardin, <a href="/A269774/b269774.txt">Table of n, a(n) for n = 1..210</a> %F A269774 Empirical: a(n) = 12*a(n-1) - 30*a(n-2) - 36*a(n-3). %F A269774 Empirical g.f.: 7*x*(1 - 5*x - 5*x^2) / ((1 - 6*x)*(1 - 6*x - 6*x^2)). - _Colin Barker_, Jan 29 2019 %e A269774 Some solutions for n=6: %e A269774 ..5. .1. .2. .3. .0. .4. .4. .6. .0. .1. .1. .5. .5. .0. .2. .5 %e A269774 ..2. .1. .0. .3. .4. .3. .0. .0. .5. .1. .2. .4. .2. .0. .3. .1 %e A269774 ..2. .0. .6. .0. .1. .0. .4. .2. .5. .2. .4. .0. .6. .3. .0. .2 %e A269774 ..2. .0. .5. .4. .2. .3. .5. .6. .2. .0. .0. .4. .5. .6. .1. .3 %e A269774 ..4. .6. .1. .3. .6. .1. .1. .2. .0. .6. .0. .6. .0. .2. .3. .0 %e A269774 ..2. .2. .6. .0. .2. .5. .6. .1. .0. .2. .2. .2. .0. .2. .5. .0 %Y A269774 Column 6 of A269776. %K A269774 nonn %O A269774 1,1 %A A269774 _R. H. Hardin_, Mar 04 2016