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.

A248439 Number of length 6+2 0..n arrays with every three consecutive terms having the sum of some two elements equal to twice the third.

This page as a plain text file.
%I A248439 #6 Jul 23 2025 11:42:16
%S A248439 2,9,44,261,590,1105,1684,2775,3978,5365,6776,8639,10512,12467,14562,
%T A248439 17349,20144,23213,26282,29727,33264,36831,40398,44775,49264,53769,
%U A248439 58386,63261,68136,73375,78614,84601,90640,96693,102922,109691,116460,123235
%N A248439 Number of length 6+2 0..n arrays with every three consecutive terms having the sum of some two elements equal to twice the third.
%C A248439 Row 6 of A248433
%H A248439 R. H. Hardin, <a href="/A248439/b248439.txt">Table of n, a(n) for n = 1..210</a>
%e A248439 Some solutions for n=6
%e A248439 ..4....4....5....5....2....3....4....5....5....3....2....0....1....6....2....1
%e A248439 ..6....0....3....3....0....1....2....3....4....4....0....1....3....2....1....3
%e A248439 ..2....2....1....1....1....2....6....4....3....2....4....2....5....4....3....2
%e A248439 ..4....4....2....5....2....3....4....2....2....3....2....3....1....0....2....1
%e A248439 ..6....0....0....3....3....4....2....3....4....4....6....4....3....2....4....3
%e A248439 ..5....2....1....1....4....5....6....1....3....2....4....5....5....4....0....5
%e A248439 ..4....4....2....5....5....3....4....5....2....3....5....3....4....0....2....4
%e A248439 ..6....3....3....3....3....1....5....3....4....4....3....4....3....2....1....3
%K A248439 nonn
%O A248439 1,1
%A A248439 _R. H. Hardin_, Oct 06 2014