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.

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

This page as a plain text file.
%I A249215 #5 Jul 23 2025 11:55:14
%S A249215 496,11874,183516,1287632,6631348,26526142,89437990,259680594,
%T A249215 678836386,1608960332,3563385010,7370543098,14518880248,27241408064,
%U A249215 49261449504,85646747520,144718409622,237078221134
%N A249215 Number of length 3+6 0..n arrays with no seven consecutive terms having five times the sum of any two elements equal to two times the sum of the remaining five.
%C A249215 Row 3 of A249212
%e A249215 Some solutions for n=3
%e A249215 ..0....2....0....2....0....2....0....2....0....2....2....0....2....0....2....2
%e A249215 ..2....1....0....3....0....2....2....1....3....2....1....3....2....0....0....1
%e A249215 ..0....2....0....3....2....3....1....0....1....3....2....1....2....2....1....3
%e A249215 ..1....0....1....0....3....3....3....1....1....3....3....0....3....0....1....1
%e A249215 ..0....0....3....0....3....1....2....0....1....3....0....1....1....1....0....0
%e A249215 ..0....0....2....3....1....2....2....0....2....1....1....3....1....1....3....2
%e A249215 ..2....3....2....3....0....0....2....1....2....3....2....3....1....2....3....1
%e A249215 ..0....0....0....0....0....0....1....2....0....1....2....2....1....0....2....3
%e A249215 ..1....0....2....0....2....0....2....0....3....3....1....1....2....2....2....3
%K A249215 nonn
%O A249215 1,1
%A A249215 _R. H. Hardin_, Oct 23 2014