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 A246475 #7 Nov 06 2018 04:12:13 %S A246475 172,484,1376,3904,11020,31104,87888,248568,702724,1985932,5612156, %T A246475 15862556,44837136,126731180,358188232,1012377900,2861418780, %U A246475 8087637712,22859103016,64609341900,182613147216,516142417472,1458837964296 %N A246475 Number of length n+3 0..4 arrays with no pair in any consecutive four terms totalling exactly 4. %H A246475 R. H. Hardin, <a href="/A246475/b246475.txt">Table of n, a(n) for n = 1..210</a> %F A246475 Empirical: a(n) = 2*a(n-1) + a(n-3) + 14*a(n-4) + 3*a(n-5) + 6*a(n-6) + a(n-8) + a(n-9). %F A246475 Empirical g.f.: 4*x*(43 + 35*x + 102*x^2 + 245*x^3 + 80*x^4 + 99*x^5 + 7*x^6 + 21*x^7 + 16*x^8) / (1 - 2*x - x^3 - 14*x^4 - 3*x^5 - 6*x^6 - x^8 - x^9). - _Colin Barker_, Nov 06 2018 %e A246475 Some solutions for n=6: %e A246475 ..4....4....0....0....1....2....3....3....3....3....1....3....0....0....4....1 %e A246475 ..4....4....0....3....1....0....4....4....2....3....1....0....0....0....2....2 %e A246475 ..3....1....0....3....0....3....2....4....0....4....1....3....0....0....3....1 %e A246475 ..4....2....1....3....1....3....4....4....0....4....4....0....2....3....4....1 %e A246475 ..4....1....1....0....0....0....3....1....3....3....1....3....1....3....4....4 %e A246475 ..4....4....2....2....2....0....4....4....0....4....1....0....0....3....4....4 %e A246475 ..4....4....4....3....1....0....4....1....2....4....1....0....1....2....4....2 %e A246475 ..3....4....1....3....0....3....4....2....0....2....4....2....1....3....4....3 %e A246475 ..2....4....4....0....0....3....4....1....3....4....2....3....1....4....4....3 %Y A246475 Column 4 of A246479. %K A246475 nonn %O A246475 1,1 %A A246475 _R. H. Hardin_, Aug 27 2014