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.

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

This page as a plain text file.
%I A246889 #6 Jun 02 2025 10:14:33
%S A246889 6210,33294,177648,942216,4971120,26346486,139555230,738947844,
%T A246889 3912529200,20719113168,109715387730,580975750422,3076449953280,
%U A246889 16290853187184,86265445976256,456803864051526,2418927144356598
%N A246889 Number of length n+4 0..5 arrays with some pair in every consecutive five terms totalling exactly 5.
%C A246889 Column 5 of A246892
%H A246889 R. H. Hardin, <a href="/A246889/b246889.txt">Table of n, a(n) for n = 1..210</a>
%F A246889 Empirical: a(n) = 3*a(n-1) +7*a(n-2) +19*a(n-3) +53*a(n-4) -40*a(n-5) -36*a(n-6) -24*a(n-7) -64*a(n-8) +16*a(n-9) +29*a(n-10) -3*a(n-11) +5*a(n-12) +a(n-13) -a(n-14)
%e A246889 Some solutions for n=3
%e A246889 ..4....1....4....4....1....3....4....0....4....3....1....3....3....0....1....1
%e A246889 ..4....0....4....3....4....4....1....5....1....5....0....2....4....5....3....0
%e A246889 ..1....4....0....0....3....0....4....5....3....4....4....0....5....0....4....0
%e A246889 ..1....1....1....4....2....5....5....5....0....0....1....1....1....5....5....4
%e A246889 ..1....0....5....5....2....2....0....3....5....4....3....3....4....3....1....2
%e A246889 ..5....4....0....4....5....4....4....2....5....5....3....5....2....2....4....1
%e A246889 ..0....1....4....0....5....5....2....3....5....3....2....1....3....2....3....4
%K A246889 nonn
%O A246889 1,1
%A A246889 _R. H. Hardin_, Sep 06 2014