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.

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

This page as a plain text file.
%I A246895 #6 Jul 23 2025 11:32:43
%S A246895 112,1961,12544,57585,177648,484297,1079680,2256929,4207600,7537641,
%T A246895 12554112,20344081,31352944,47355785,68954368,98858817,137838960,
%U A246895 189828649,255769600,341151281,447081712,580982601,744111744,946245985
%N A246895 Number of length 3+4 0..n arrays with some pair in every consecutive five terms totalling exactly n.
%C A246895 Row 3 of A246892
%H A246895 R. H. Hardin, <a href="/A246895/b246895.txt">Table of n, a(n) for n = 1..210</a>
%F A246895 Empirical: a(n) = 2*a(n-1) +4*a(n-2) -10*a(n-3) -5*a(n-4) +20*a(n-5) -20*a(n-7) +5*a(n-8) +10*a(n-9) -4*a(n-10) -2*a(n-11) +a(n-12)
%e A246895 Some solutions for n=5
%e A246895 ..1....0....3....0....3....1....1....1....1....3....3....1....1....0....1....0
%e A246895 ..0....3....0....4....2....0....3....3....3....1....5....0....3....2....1....4
%e A246895 ..1....3....4....3....0....5....2....1....2....3....2....4....2....4....1....0
%e A246895 ..1....2....1....1....3....4....0....2....0....2....1....0....1....2....2....0
%e A246895 ..4....0....1....5....4....2....2....3....2....2....3....1....5....1....4....5
%e A246895 ..3....0....5....2....5....1....1....3....1....4....4....4....1....3....2....4
%e A246895 ..3....1....1....5....4....5....5....2....4....4....5....3....3....4....0....4
%K A246895 nonn
%O A246895 1,1
%A A246895 _R. H. Hardin_, Sep 06 2014