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.

A248999 Number of length n+4 0..6 arrays with no five consecutive terms having two times the sum of any three elements equal to three times the sum of the remaining two.

This page as a plain text file.
%I A248999 #6 Jul 23 2025 11:49:22
%S A248999 13990,82348,485580,2865126,16909524,99817384,589354152,3479916010,
%T A248999 20548067494,121333048614,716461085260,4230692840640,24982283288368,
%U A248999 147520857046232,871114227605828,5143954672207112,30375223032465730
%N A248999 Number of length n+4 0..6 arrays with no five consecutive terms having two times the sum of any three elements equal to three times the sum of the remaining two.
%C A248999 Column 6 of A249001
%H A248999 R. H. Hardin, <a href="/A248999/b248999.txt">Table of n, a(n) for n = 1..210</a>
%e A248999 Some solutions for n=2
%e A248999 ..5....1....0....5....3....6....1....6....4....5....4....6....6....0....5....5
%e A248999 ..3....6....6....3....5....5....5....4....0....4....6....3....5....3....3....0
%e A248999 ..1....6....4....6....3....1....4....3....1....5....5....1....1....5....0....2
%e A248999 ..4....0....5....1....3....3....5....0....1....0....5....2....0....1....2....0
%e A248999 ..1....5....6....2....5....3....3....3....5....4....1....2....5....2....5....3
%e A248999 ..3....0....3....1....6....0....1....6....0....3....4....1....0....2....3....4
%K A248999 nonn
%O A248999 1,1
%A A248999 _R. H. Hardin_, Oct 18 2014