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 A269779 #8 Jan 29 2019 09:26:58 %S A269779 66,1740,14724,73680,270150,804636,2063880,4728384,9915210,19361100, %T A269779 35650956,62496720,105071694,170405340,267843600,409579776,611261010, %U A269779 892675404,1278524820,1799288400,2492181846,3402217500,4583370264 %N A269779 Number of length-7 0..n arrays with every repeated value unequal to the previous repeated value plus one mod n+1. %H A269779 R. H. Hardin, <a href="/A269779/b269779.txt">Table of n, a(n) for n = 1..210</a> %F A269779 Empirical: a(n) = n^7 + 7*n^6 + 21*n^5 + 25*n^4 + 11*n^3 + n^2. %F A269779 Conjectures from _Colin Barker_, Jan 29 2019: (Start) %F A269779 G.f.: 6*x*(11 + 202*x + 442*x^2 + 152*x^3 + 27*x^4 + 6*x^5) / (1 - x)^8. %F A269779 a(n) = 8*a(n-1) - 28*a(n-2) + 56*a(n-3) - 70*a(n-4) + 56*a(n-5) - 28*a(n-6) + 8*a(n-7) - a(n-8) for n>8. %F A269779 (End) %e A269779 Some solutions for n=3: %e A269779 ..0. .3. .0. .3. .1. .2. .0. .3. .0. .0. .2. .0. .0. .3. .3. .0 %e A269779 ..0. .3. .0. .1. .2. .2. .1. .0. .1. .3. .2. .0. .2. .2. .0. .0 %e A269779 ..0. .1. .2. .2. .1. .3. .2. .0. .3. .0. .2. .1. .2. .1. .1. .2 %e A269779 ..0. .2. .1. .1. .0. .2. .0. .3. .1. .1. .1. .3. .2. .3. .1. .1 %e A269779 ..2. .3. .2. .1. .0. .2. .0. .2. .0. .1. .1. .3. .0. .0. .0. .3 %e A269779 ..2. .1. .0. .1. .0. .3. .1. .3. .1. .3. .2. .1. .1. .2. .1. .0 %e A269779 ..2. .3. .2. .2. .2. .0. .2. .0. .1. .3. .0. .0. .1. .3. .1. .2 %Y A269779 Row 7 of A269776. %K A269779 nonn %O A269779 1,1 %A A269779 _R. H. Hardin_, Mar 04 2016