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.

A249465 Number of length n+4 0..7 arrays with no five consecutive terms having four times any element equal to the sum of the remaining four.

This page as a plain text file.
%I A249465 #6 Jul 23 2025 12:01:21
%S A249465 29060,207760,1488294,10671554,76550058,549183692,3940066010,
%T A249465 28268238072,202814997034,1455140474848,10440249554448,74906102995968,
%U A249465 537432238422096,3855940687831096,27665406008609022,198492352203114492
%N A249465 Number of length n+4 0..7 arrays with no five consecutive terms having four times any element equal to the sum of the remaining four.
%C A249465 Column 7 of A249466
%H A249465 R. H. Hardin, <a href="/A249465/b249465.txt">Table of n, a(n) for n = 1..210</a>
%e A249465 Some solutions for n=1
%e A249465 ..3....3....6....7....1....1....6....3....2....2....4....0....0....6....0....0
%e A249465 ..6....0....3....3....5....0....4....3....3....1....3....0....6....2....7....5
%e A249465 ..5....4....6....5....4....0....1....2....6....0....2....6....3....0....2....7
%e A249465 ..7....4....3....7....7....7....0....3....3....3....3....4....7....2....0....1
%e A249465 ..6....7....2....0....0....5....5....1....3....5....5....3....5....4....4....1
%K A249465 nonn
%O A249465 1,1
%A A249465 _R. H. Hardin_, Oct 29 2014