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.

A249006 Number of length 5+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 A249006 #6 Jul 23 2025 11:50:04
%S A249006 416,6872,91888,706704,4149708,16909524,61034658,179220600,484680810,
%T A249006 1179584718,2691862296,5660060962,11419487998,21680491596,39877845854,
%U A249006 70202009284,120203803140,198769546216,321758154748,506644858160
%N A249006 Number of length 5+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 A249006 Row 5 of A249001
%H A249006 R. H. Hardin, <a href="/A249006/b249006.txt">Table of n, a(n) for n = 1..65</a>
%e A249006 Some solutions for n=3
%e A249006 ..0....0....1....1....0....3....0....0....1....1....0....0....3....1....2....2
%e A249006 ..2....0....3....3....3....0....1....2....2....2....0....2....2....0....2....2
%e A249006 ..1....1....2....0....3....2....0....0....0....0....0....2....2....2....0....1
%e A249006 ..0....3....3....1....0....0....1....2....3....1....0....1....3....1....2....0
%e A249006 ..3....0....3....1....3....1....2....3....1....3....1....2....1....3....3....2
%e A249006 ..3....2....2....1....0....0....3....0....3....2....1....2....1....1....2....1
%e A249006 ..1....0....2....1....2....0....0....2....1....2....0....2....2....1....0....0
%e A249006 ..0....3....1....2....3....2....3....2....1....1....2....0....1....0....0....0
%e A249006 ..0....3....3....3....3....3....0....2....0....1....2....0....3....1....1....0
%K A249006 nonn
%O A249006 1,1
%A A249006 _R. H. Hardin_, Oct 18 2014