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.

A248466 Number of length 5+2 0..n arrays with no three consecutive terms having the sum of any two elements equal to twice the third.

This page as a plain text file.
%I A248466 #6 Jul 23 2025 11:44:20
%S A248466 42,288,4488,24160,105026,332940,948412,2299356,5183202,10554328,
%T A248466 20406996,37023484,64595054,107536496,173894220,271712160,414759462,
%U A248466 616455068,899198128,1284256968,1806180638,2496566424,3406477720
%N A248466 Number of length 5+2 0..n arrays with no three consecutive terms having the sum of any two elements equal to twice the third.
%C A248466 Row 5 of A248461
%H A248466 R. H. Hardin, <a href="/A248466/b248466.txt">Table of n, a(n) for n = 1..210</a>
%e A248466 Some solutions for n=5
%e A248466 ..1....1....0....0....1....0....0....3....2....1....3....4....2....4....0....2
%e A248466 ..4....0....0....2....1....3....3....4....0....3....3....4....4....0....4....1
%e A248466 ..1....0....1....0....5....3....1....1....2....3....0....2....1....1....5....2
%e A248466 ..5....5....5....3....1....4....0....5....0....5....3....4....1....4....5....5
%e A248466 ..0....5....0....0....2....0....3....4....2....0....0....5....5....2....3....3
%e A248466 ..4....3....1....5....1....0....3....1....2....5....2....0....0....5....0....2
%e A248466 ..5....3....1....4....4....2....5....0....0....0....3....3....3....4....0....5
%K A248466 nonn
%O A248466 1,1
%A A248466 _R. H. Hardin_, Oct 06 2014