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 A221575 #8 Aug 08 2018 18:36:55 %S A221575 6,57,342,1293,3734,8991,19014,36497,64998,109059,174326,267669, %T A221575 397302,572903,805734,1108761,1496774,1986507,2596758,3348509,4265046, %U A221575 5372079,6697862,8273313,10132134,12310931,14849334,17790117,21179318,25066359 %N A221575 Number of 0..n arrays of length 5 with each element differing from at least one neighbor by something other than 1. %C A221575 Row 5 of A221573. %H A221575 R. H. Hardin, <a href="/A221575/b221575.txt">Table of n, a(n) for n = 1..210</a> %F A221575 Empirical: a(n) = 1*n^5 + 1*n^4 - 2*n^3 + 12*n^2 - 15*n + 9 for n>2. %F A221575 Conjectures from _Colin Barker_, Aug 08 2018: (Start) %F A221575 G.f.: x*(6 + 21*x + 90*x^2 - 24*x^3 + 56*x^4 - 39*x^5 + 12*x^6 - 2*x^7) / (1 - x)^6. %F A221575 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>8. %F A221575 (End) %e A221575 Some solutions for n=6: %e A221575 ..6....5....2....5....5....0....2....0....1....2....3....0....3....1....1....1 %e A221575 ..4....3....0....0....5....3....5....5....1....6....6....6....3....4....3....5 %e A221575 ..0....3....1....3....2....0....4....0....3....6....0....3....5....2....3....6 %e A221575 ..0....3....6....5....2....0....4....2....4....6....4....1....0....2....0....0 %e A221575 ..0....1....2....0....4....2....1....0....6....6....1....5....3....2....2....0 %Y A221575 Cf. A221573. %K A221575 nonn %O A221575 1,1 %A A221575 _R. H. Hardin_, Jan 20 2013