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.

A249007 Number of length 6+4 0..n 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 A249007 #6 Jul 23 2025 11:50:10
%S A249007 802,16800,299044,2888944,20952218,99817384,418454994,1385871140,
%T A249007 4201910020,11319995234,28417289280,65009432892,142222105640,
%U A249007 290405064290,573014867750,1075969706928,1959720585922,3431451616020
%N A249007 Number of length 6+4 0..n 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 A249007 Row 6 of A249001
%H A249007 R. H. Hardin, <a href="/A249007/b249007.txt">Table of n, a(n) for n = 1..65</a>
%e A249007 Some solutions for n=2
%e A249007 ..2....1....1....0....0....0....0....0....1....0....0....0....2....2....0....1
%e A249007 ..1....0....1....0....2....0....2....0....2....1....0....2....1....2....2....1
%e A249007 ..0....0....1....0....0....1....0....2....2....1....0....0....0....2....1....2
%e A249007 ..2....1....2....1....1....0....2....1....1....0....1....2....2....1....0....2
%e A249007 ..2....1....1....0....1....1....0....1....1....0....1....2....2....1....0....1
%e A249007 ..2....2....2....1....0....0....0....0....1....1....1....1....1....0....1....0
%e A249007 ..1....0....1....0....0....1....1....2....1....0....0....1....2....0....1....1
%e A249007 ..1....0....2....0....2....2....0....2....0....0....0....0....2....1....1....2
%e A249007 ..2....1....2....0....1....2....1....2....1....0....0....2....2....0....0....2
%e A249007 ..2....0....1....1....1....2....0....0....1....1....0....2....1....2....0....1
%K A249007 nonn
%O A249007 1,1
%A A249007 _R. H. Hardin_, Oct 18 2014