cp's OEIS Frontend

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.

A246897 Number of length 5+4 0..n arrays with some pair in every consecutive five terms totalling exactly n.

This page as a plain text file.
%I A246897 #6 Jul 23 2025 11:32:57
%S A246897 416,16621,173056,1216081,4971120,17677453,47799488,120392449,
%T A246897 259777600,536775181,1005318336,1828277521,3107102096,5168689261,
%U A246897 8183025280,12745702273,19117702368,28308317869,40691100800,57882676561,80386887856
%N A246897 Number of length 5+4 0..n arrays with some pair in every consecutive five terms totalling exactly n.
%C A246897 Row 5 of A246892
%H A246897 R. H. Hardin, <a href="/A246897/b246897.txt">Table of n, a(n) for n = 1..65</a>
%F A246897 Empirical: a(n) = 2*a(n-1) +5*a(n-2) -12*a(n-3) -9*a(n-4) +30*a(n-5) +5*a(n-6) -40*a(n-7) +5*a(n-8) +30*a(n-9) -9*a(n-10) -12*a(n-11) +5*a(n-12) +2*a(n-13) -a(n-14)
%e A246897 Some solutions for n=3
%e A246897 ..3....2....0....3....2....0....0....1....2....0....0....0....0....0....2....0
%e A246897 ..2....2....0....2....1....3....3....0....0....3....0....0....2....1....3....3
%e A246897 ..2....2....1....0....2....2....1....2....0....2....0....3....1....2....0....0
%e A246897 ..2....1....2....0....1....1....0....0....1....2....2....0....2....2....1....1
%e A246897 ..1....0....3....3....0....0....1....1....1....0....3....3....0....2....1....2
%e A246897 ..0....1....2....2....1....0....2....2....3....1....3....3....0....3....3....1
%e A246897 ..2....3....3....3....3....3....1....2....2....1....0....1....0....1....0....2
%e A246897 ..2....0....0....1....1....1....1....1....0....3....3....0....3....3....0....0
%e A246897 ..1....0....1....1....0....0....0....3....3....1....1....0....3....0....2....2
%K A246897 nonn
%O A246897 1,1
%A A246897 _R. H. Hardin_, Sep 06 2014