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 A246741 #6 Jul 23 2025 11:32:12 %S A246741 2,30,1156,7612,66294,276762,1231304,3780600,11549290,28599190, %T A246741 69230412,147079860,304811486,578865042,1074611344,1875204592, %U A246741 3208049874,5242291470,8421730580,13061681580,19963508422,29676180490,43560086616 %N A246741 Number of length 4+4 0..n arrays with no pair in any consecutive five terms totalling exactly n. %C A246741 Row 4 of A246737 %H A246741 R. H. Hardin, <a href="/A246741/b246741.txt">Table of n, a(n) for n = 1..69</a> %F A246741 Empirical: a(n) = 3*a(n-1) +3*a(n-2) -17*a(n-3) +3*a(n-4) +39*a(n-5) -25*a(n-6) -45*a(n-7) +45*a(n-8) +25*a(n-9) -39*a(n-10) -3*a(n-11) +17*a(n-12) -3*a(n-13) -3*a(n-14) +a(n-15) %e A246741 Some solutions for n=4 %e A246741 ..2....1....1....2....3....1....1....4....3....0....0....3....4....3....2....2 %e A246741 ..0....2....4....3....4....2....0....4....3....2....3....2....4....0....1....1 %e A246741 ..3....1....4....0....3....0....0....1....0....0....2....4....3....3....1....1 %e A246741 ..3....4....4....0....3....1....2....4....2....3....3....4....3....2....1....4 %e A246741 ..3....1....2....0....3....1....1....2....0....0....3....4....3....0....0....4 %e A246741 ..3....4....1....2....3....0....1....1....0....3....4....1....3....0....1....1 %e A246741 ..3....4....1....1....4....0....1....1....1....2....4....4....0....0....1....2 %e A246741 ..3....4....1....1....4....2....4....1....0....3....4....1....0....3....2....4 %K A246741 nonn %O A246741 1,1 %A A246741 _R. H. Hardin_, Sep 02 2014