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 A246002 #6 Jul 23 2025 11:31:14 %S A246002 2,82,5572,75260,728358,4108062,18838280,66983128,209732170,567864650, %T A246002 1413132492,3203059092,6839534702,13687432150,26203871248,47834595632, %U A246002 84386904210,143553121218,237664797140,382348873900,601693049782 %N A246002 Number of length 7+2 0..n arrays with no pair in any consecutive three terms totalling exactly n. %C A246002 Row 7 of A245995 %H A246002 R. H. Hardin, <a href="/A246002/b246002.txt">Table of n, a(n) for n = 1..210</a> %F A246002 Empirical: a(n) = 3*a(n-1) +4*a(n-2) -20*a(n-3) +56*a(n-5) -28*a(n-6) -84*a(n-7) +70*a(n-8) +70*a(n-9) -84*a(n-10) -28*a(n-11) +56*a(n-12) -20*a(n-14) +4*a(n-15) +3*a(n-16) -a(n-17) %e A246002 Some solutions for n=4 %e A246002 ..0....2....1....4....4....2....4....2....4....2....2....2....3....4....4....4 %e A246002 ..1....4....0....1....2....4....2....4....3....3....4....3....2....1....1....1 %e A246002 ..1....1....1....1....1....4....3....3....4....4....1....3....3....1....1....4 %e A246002 ..0....2....1....2....1....1....4....2....2....4....2....4....3....4....4....4 %e A246002 ..0....1....1....1....0....2....2....3....3....3....4....4....4....1....1....1 %e A246002 ..3....1....1....1....2....0....3....0....3....3....4....1....4....4....2....2 %e A246002 ..2....4....2....0....1....1....0....3....2....4....2....2....3....1....4....4 %e A246002 ..4....1....1....2....1....1....2....3....4....2....1....0....3....1....3....1 %e A246002 ..1....2....0....3....4....1....3....0....3....1....1....1....0....2....3....1 %K A246002 nonn %O A246002 1,1 %A A246002 _R. H. Hardin_, Aug 09 2014