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.

A245992 Number of length n+2 0..5 arrays with no pair in any consecutive three terms totalling exactly 5.

This page as a plain text file.
%I A245992 #8 Jun 02 2025 10:13:37
%S A245992 126,534,2262,9582,40590,171942,728358,3085374,13069854,55364790,
%T A245992 234529014,993480846,4208452398,17827290438,75517614150,319897747038,
%U A245992 1355108602302,5740332156246,24316437227286,103006081065390
%N A245992 Number of length n+2 0..5 arrays with no pair in any consecutive three terms totalling exactly 5.
%C A245992 Column 5 of A245995
%H A245992 R. H. Hardin, <a href="/A245992/b245992.txt">Table of n, a(n) for n = 1..210</a>
%F A245992 Empirical: a(n) = 4*a(n-1) +a(n-2).
%F A245992 Empirical: G.f.: -6*x*(21+5*x) / ( -1+4*x+x^2 ). - _R. J. Mathar_, Aug 10 2014
%e A245992 Some solutions for n=6
%e A245992 ..3....1....0....1....3....0....0....3....1....1....4....3....1....0....1....4
%e A245992 ..3....2....0....3....5....1....0....3....2....0....3....1....2....2....1....4
%e A245992 ..0....1....0....1....5....0....2....4....2....3....5....3....1....1....3....2
%e A245992 ..4....2....1....1....3....2....1....4....4....3....5....3....2....0....5....0
%e A245992 ..4....5....1....5....1....0....2....2....0....0....2....0....0....1....5....1
%e A245992 ..5....2....5....2....5....2....2....2....3....0....4....0....4....0....4....3
%e A245992 ..5....1....2....5....2....1....4....0....3....0....2....2....2....3....4....1
%e A245992 ..1....2....2....5....2....2....4....2....0....1....0....4....4....0....2....0
%K A245992 nonn
%O A245992 1,1
%A A245992 _R. H. Hardin_, Aug 09 2014