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 A269777 #8 Jan 29 2019 05:49:46 %S A269777 24,222,984,3060,7680,16674,32592,58824,99720,160710,248424,370812, %T A269777 537264,758730,1047840,1419024,1888632,2475054,3198840,4082820, %U A269777 5152224,6434802,7960944,9763800,11879400,14346774,17208072,20508684,24297360 %N A269777 Number of length-5 0..n arrays with every repeated value unequal to the previous repeated value plus one mod n+1. %H A269777 R. H. Hardin, <a href="/A269777/b269777.txt">Table of n, a(n) for n = 1..210</a> %F A269777 Empirical: a(n) = n^5 + 5*n^4 + 10*n^3 + 7*n^2 + n. %F A269777 Conjectures from _Colin Barker_, Jan 29 2019: (Start) %F A269777 G.f.: 6*x*(4 + 13*x + 2*x^2 + x^3) / (1 - x)^6. %F A269777 a(n) = 6*a(n-1) - 15*a(n-2) + 20*a(n-3) - 15*a(n-4) + 6*a(n-5) - a(n-6) for n>6. %F A269777 (End) %e A269777 Some solutions for n=3: %e A269777 ..1. .1. .0. .3. .1. .0. .1. .0. .1. .3. .0. .0. .0. .0. .1. .0 %e A269777 ..0. .0. .1. .0. .3. .2. .0. .2. .0. .0. .0. .0. .0. .0. .1. .3 %e A269777 ..2. .2. .1. .1. .0. .2. .2. .3. .3. .0. .1. .2. .0. .2. .2. .3 %e A269777 ..0. .3. .0. .2. .3. .3. .1. .3. .0. .0. .2. .3. .2. .3. .1. .3 %e A269777 ..3. .3. .3. .2. .1. .1. .2. .3. .3. .2. .2. .1. .0. .3. .0. .0 %Y A269777 Row 5 of A269776. %K A269777 nonn %O A269777 1,1 %A A269777 _R. H. Hardin_, Mar 04 2016