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 A245956 #6 Jul 23 2025 11:30:35 %S A245956 298,11441,88804,525041,1744494,5208673,12257032,27206945,53051890, %T A245956 99643601,172531308,290962321,464076214,725751041,1089854224, %U A245956 1611694913,2311078842,3273303025,4525364980,6193054001,8311825918,11060605601 %N A245956 Number of length 6+3 0..n arrays with some pair in every consecutive four terms totalling exactly n. %C A245956 Row 6 of A245950 %H A245956 R. H. Hardin, <a href="/A245956/b245956.txt">Table of n, a(n) for n = 1..210</a> %F A245956 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 A245956 Some solutions for n=3 %e A245956 ..2....0....1....2....2....0....1....2....1....0....3....3....2....1....3....2 %e A245956 ..1....3....1....0....1....2....3....1....2....3....2....3....2....2....2....2 %e A245956 ..3....1....2....2....2....1....2....0....0....3....1....2....1....1....3....1 %e A245956 ..0....0....3....3....2....1....1....1....3....0....3....1....0....2....1....3 %e A245956 ..0....2....1....1....0....2....3....3....3....3....3....2....3....0....3....3 %e A245956 ..0....3....2....2....3....2....2....1....0....0....0....0....3....0....0....2 %e A245956 ..3....3....0....2....2....1....1....0....3....2....3....0....2....3....0....1 %e A245956 ..3....1....3....0....0....3....0....3....3....3....0....3....1....3....3....1 %e A245956 ..3....0....1....1....0....1....0....3....2....3....1....0....0....3....3....0 %K A245956 nonn %O A245956 1,1 %A A245956 _R. H. Hardin_, Aug 08 2014