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.

A249213 Number of length 1+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 A249213 #6 Jul 23 2025 11:55:01
%S A249213 126,1792,14336,67452,242494,714980,1826748,4173442,8762390,17110282,
%T A249213 31597020,55472158,93560894,152043682,239777076,367458644,550136314,
%U A249213 805205100,1156638980,1631284144,2265657954,3099326244,4185802572
%N A249213 Number of length 1+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 A249213 Row 1 of A249212
%H A249213 R. H. Hardin, <a href="/A249213/b249213.txt">Table of n, a(n) for n = 1..41</a>
%e A249213 Some solutions for n=4
%e A249213 ..4....3....1....1....1....1....2....4....2....0....4....3....1....3....2....3
%e A249213 ..1....0....4....4....1....4....1....2....2....1....4....4....1....2....3....2
%e A249213 ..4....1....4....0....3....3....4....2....4....2....2....2....1....1....4....2
%e A249213 ..1....1....4....0....2....2....3....2....0....0....2....4....1....1....4....1
%e A249213 ..2....4....1....0....3....4....4....1....1....2....2....0....0....2....3....4
%e A249213 ..1....0....3....4....0....3....3....4....1....1....2....1....4....4....4....1
%e A249213 ..3....4....2....2....0....0....0....3....0....2....1....2....1....2....3....3
%K A249213 nonn
%O A249213 1,1
%A A249213 _R. H. Hardin_, Oct 23 2014