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.

A249209 Number of length n+6 0..5 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 A249209 #6 Jul 23 2025 11:54:34
%S A249209 242494,1267754,6631348,34695508,181549572,950035900,4971575032,
%T A249209 26016562386,136146815610,712472439202,3728460724848,19511550499928,
%U A249209 102106757625448,534339759748798,2796279526923770,14633349377034482
%N A249209 Number of length n+6 0..5 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 A249209 Column 5 of A249212
%H A249209 R. H. Hardin, <a href="/A249209/b249209.txt">Table of n, a(n) for n = 1..210</a>
%e A249209 Some solutions for n=1
%e A249209 ..1....0....3....3....0....1....1....1....3....0....3....0....3....0....0....3
%e A249209 ..0....0....3....3....0....0....0....3....0....1....1....5....2....4....5....1
%e A249209 ..2....1....4....2....4....4....5....5....1....4....0....2....0....0....3....5
%e A249209 ..2....0....3....5....5....1....2....4....2....1....5....1....5....1....1....0
%e A249209 ..3....5....2....0....2....2....5....5....4....0....0....1....3....5....3....3
%e A249209 ..5....0....2....2....2....2....1....3....1....2....4....3....2....5....4....4
%e A249209 ..2....0....5....2....4....5....4....2....1....0....3....1....1....5....0....4
%K A249209 nonn
%O A249209 1,1
%A A249209 _R. H. Hardin_, Oct 23 2014