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.

A249005 Number of length 4+4 0..n arrays with no five consecutive terms having two times the sum of any three elements equal to three times the sum of the remaining two.

This page as a plain text file.
%I A249005 #6 Jul 23 2025 11:49:57
%S A249005 216,2802,28240,172888,822348,2865126,8902860,23177368,55906496,
%T A249005 122921570,254998668,492803174,916912140,1618570176,2775224082,
%U A249005 4580364152,7372967710,11513855042,17636594106,26371506592,38792087628
%N A249005 Number of length 4+4 0..n arrays with no five consecutive terms having two times the sum of any three elements equal to three times the sum of the remaining two.
%C A249005 Row 4 of A249001
%H A249005 R. H. Hardin, <a href="/A249005/b249005.txt">Table of n, a(n) for n = 1..69</a>
%e A249005 Some solutions for n=4
%e A249005 ..0....0....2....0....0....0....1....0....2....0....2....0....0....2....0....1
%e A249005 ..1....1....3....3....4....1....3....3....3....4....3....0....1....2....1....4
%e A249005 ..0....4....1....1....3....0....0....0....4....1....3....3....1....0....0....3
%e A249005 ..0....1....4....0....4....2....4....4....4....0....2....4....4....4....0....2
%e A249005 ..1....0....3....0....2....0....1....1....0....0....4....1....3....4....4....3
%e A249005 ..2....0....0....0....1....0....0....0....1....1....0....3....2....4....0....0
%e A249005 ..3....0....4....4....3....0....3....0....0....4....2....1....1....0....0....1
%e A249005 ..0....4....3....3....1....4....3....2....0....3....0....3....3....2....2....1
%K A249005 nonn
%O A249005 1,1
%A A249005 _R. H. Hardin_, Oct 18 2014