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.

A248467 Number of length 6+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 A248467 #6 Jul 23 2025 11:44:27
%S A248467 68,576,14040,96736,520788,1952254,6493036,17917712,45541888,
%T A248467 102869198,219106196,433633802,820820502,1471721904,2552955354,
%U A248467 4256615846,6910769098,10880058248,16766422418,25217401274,37267800170,53987521754
%N A248467 Number of length 6+2 0..n arrays with no three consecutive terms having the sum of any two elements equal to twice the third.
%C A248467 Row 6 of A248461
%H A248467 R. H. Hardin, <a href="/A248467/b248467.txt">Table of n, a(n) for n = 1..210</a>
%e A248467 Some solutions for n=4
%e A248467 ..2....1....3....0....3....2....3....1....0....4....4....4....2....1....4....3
%e A248467 ..3....0....0....0....4....3....1....1....0....0....3....0....4....3....0....2
%e A248467 ..2....3....4....2....1....3....1....3....4....4....3....3....2....3....1....0
%e A248467 ..0....0....3....0....1....0....0....4....4....1....1....4....4....0....1....0
%e A248467 ..2....3....3....3....0....0....3....0....0....4....4....4....4....2....2....3
%e A248467 ..3....4....0....1....1....1....4....1....0....1....0....3....1....2....4....1
%e A248467 ..3....0....0....4....1....3....4....3....3....3....1....0....1....0....2....0
%e A248467 ..1....0....2....3....2....1....2....0....4....3....1....0....3....0....1....4
%K A248467 nonn
%O A248467 1,1
%A A248467 _R. H. Hardin_, Oct 06 2014