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.

A248998 Number of length n+4 0..5 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 A248998 #6 Jul 23 2025 11:49:15
%S A248998 6450,32398,163112,822348,4149708,20952218,105819690,534502810,
%T A248998 2700047696,13640156760,68910290082,348142872600,1758874033678,
%U A248998 8886170481316,44894831402844,226818881138008,1145942126329774
%N A248998 Number of length n+4 0..5 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 A248998 Column 5 of A249001
%H A248998 R. H. Hardin, <a href="/A248998/b248998.txt">Table of n, a(n) for n = 1..210</a>
%e A248998 Some solutions for n=3
%e A248998 ..0....1....0....3....0....0....4....1....4....4....0....3....0....0....0....0
%e A248998 ..0....1....5....3....1....5....1....5....1....0....2....0....1....1....5....5
%e A248998 ..3....5....4....3....2....0....3....5....3....5....0....2....1....1....4....1
%e A248998 ..4....1....5....5....2....5....5....3....5....0....1....1....0....5....4....3
%e A248998 ..5....0....0....0....1....5....4....2....5....3....1....1....0....1....3....0
%e A248998 ..4....0....4....2....2....5....4....3....0....0....0....2....2....4....1....3
%e A248998 ..3....0....5....4....0....0....5....0....5....4....1....5....4....1....5....0
%K A248998 nonn
%O A248998 1,1
%A A248998 _R. H. Hardin_, Oct 18 2014