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 A246734 #8 Nov 06 2018 11:26:45 %S A246734 1566,5430,18966,66294,231414,807630,2818830,9838974,34342350, %T A246734 119869158,418392870,1460364774,5097280614,17791629822,62100187038, %U A246734 216755476782,756566753022,2640732594966,9217254934326,32172052811478,112293843388758 %N A246734 Number of length n+4 0..5 arrays with no pair in any consecutive five terms totalling exactly 5. %H A246734 R. H. Hardin, <a href="/A246734/b246734.txt">Table of n, a(n) for n = 1..210</a> %F A246734 Empirical: a(n) = 3*a(n-1) + a(n-2) + a(n-3) + 5*a(n-4) + a(n-5) - a(n-6) - a(n-7). %F A246734 Empirical g.f.: 6*x*(261 + 122*x + 185*x^2 + 400*x^3 + 51*x^4 - 98*x^5 - 77*x^6) / ((1 + x)*(1 - 4*x + 3*x^2 - 4*x^3 - x^4 + x^6)). - _Colin Barker_, Nov 06 2018 %e A246734 Some solutions for n=4: %e A246734 ..5....2....5....3....5....5....3....3....5....2....5....2....3....3....3....5 %e A246734 ..2....0....4....3....3....4....1....3....3....5....3....4....3....3....3....2 %e A246734 ..1....4....4....0....4....4....1....1....1....4....3....0....4....1....4....4 %e A246734 ..5....2....3....4....4....2....0....0....3....2....4....0....4....1....4....2 %e A246734 ..1....0....5....3....5....4....1....0....3....4....3....4....4....5....4....2 %e A246734 ..5....2....5....0....4....0....1....0....5....4....4....0....4....5....4....2 %e A246734 ..1....0....5....0....3....2....1....3....5....4....3....2....0....5....4....2 %e A246734 ..2....0....3....4....5....0....2....1....1....5....5....2....0....3....0....1 %Y A246734 Column 5 of A246737. %K A246734 nonn %O A246734 1,1 %A A246734 _R. H. Hardin_, Sep 02 2014