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 A246896 #7 Jul 23 2025 11:32:50 %S A246896 216,5711,46656,264981,942216,2934691,7216512,16571465,33296760, %T A246896 64134231,113503296,195133981,316514856,502575851,764948736, %U A246896 1145338641,1660700952,2376636895,3316691520,4579210661,6195659976,8307888051,10956656256 %N A246896 Number of length 4+4 0..n arrays with some pair in every consecutive five terms totalling exactly n. %C A246896 Row 4 of A246892 %H A246896 R. H. Hardin, <a href="/A246896/b246896.txt">Table of n, a(n) for n = 1..73</a> %F A246896 Empirical: a(n) = 3*a(n-1) +2*a(n-2) -14*a(n-3) +5*a(n-4) +25*a(n-5) -20*a(n-6) -20*a(n-7) +25*a(n-8) +5*a(n-9) -14*a(n-10) +2*a(n-11) +3*a(n-12) -a(n-13) %e A246896 Some solutions for n=3 %e A246896 ..2....2....3....2....2....3....0....3....3....1....2....3....2....1....3....1 %e A246896 ..3....0....3....2....2....0....1....3....2....0....3....2....0....3....3....3 %e A246896 ..2....0....0....1....1....0....1....0....2....3....0....3....2....1....1....0 %e A246896 ..2....1....1....1....0....3....2....2....2....0....0....1....0....2....2....1 %e A246896 ..1....0....3....3....0....0....2....1....0....0....1....2....1....1....0....0 %e A246896 ..2....2....3....1....2....2....3....2....3....0....0....1....3....1....1....3 %e A246896 ..2....1....2....2....3....1....3....2....2....3....3....3....1....1....3....1 %e A246896 ..0....2....2....1....0....1....1....1....0....3....1....0....1....1....0....0 %K A246896 nonn %O A246896 1,1 %A A246896 _R. H. Hardin_, Sep 06 2014