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.

A249529 Number of length n+5 0..7 arrays with no six consecutive terms having five times any element equal to the sum of the remaining five.

This page as a plain text file.
%I A249529 #8 Nov 09 2014 07:12:25
%S A249529 235196,1699092,12297972,89105036,645979544,4684420552,33973205930,
%T A249529 246394508200,1787038582186,12961135262872,94006175274074,
%U A249529 681823782781788,4945255917923416,35867880222569408,260149395845852954
%N A249529 Number of length n+5 0..7 arrays with no six consecutive terms having five times any element equal to the sum of the remaining five.
%C A249529 Column 7 of A249530.
%H A249529 R. H. Hardin, <a href="/A249529/b249529.txt">Table of n, a(n) for n = 1..210</a>
%e A249529 Some solutions for n=1:
%e A249529 ..6....4....2....0....6....4....2....0....2....4....2....0....4....6....4....4
%e A249529 ..4....5....6....0....2....2....5....1....0....0....0....2....7....5....6....3
%e A249529 ..4....5....2....6....5....3....6....3....7....1....7....2....6....2....3....0
%e A249529 ..1....6....2....5....2....7....3....1....0....5....6....0....6....3....5....2
%e A249529 ..4....5....1....4....1....6....7....4....6....2....2....3....5....2....6....1
%e A249529 ..1....4....5....5....5....0....3....7....7....3....1....1....7....4....5....5
%Y A249529 Cf. A249530.
%K A249529 nonn
%O A249529 1,1
%A A249529 _R. H. Hardin_, Oct 31 2014