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.

A247539 Number of length 7+3 0..n arrays with some disjoint pairs in every consecutive four terms having the same sum.

This page as a plain text file.
%I A247539 #6 Jul 23 2025 11:36:19
%S A247539 8,217,1732,6495,16932,34695,62108,103013,156308,227701,316236,428111,
%T A247539 559992,721175,905784,1123897,1368584,1654573,1970964,2330611,2725864,
%U A247539 3169687,3650720,4190997,4769280,5406141,6091708,6842051,7638868,8509583
%N A247539 Number of length 7+3 0..n arrays with some disjoint pairs in every consecutive four terms having the same sum.
%C A247539 Row 7 of A247533
%H A247539 R. H. Hardin, <a href="/A247539/b247539.txt">Table of n, a(n) for n = 1..210</a>
%e A247539 Some solutions for n=6
%e A247539 ..1....4....4....6....6....1....5....1....1....2....6....4....0....2....3....3
%e A247539 ..2....5....6....5....5....2....2....0....3....4....3....2....3....6....4....2
%e A247539 ..1....1....3....3....4....3....3....0....4....3....5....1....1....1....2....4
%e A247539 ..0....2....5....2....5....2....0....1....2....1....2....3....2....5....3....5
%e A247539 ..1....4....4....4....6....3....1....1....3....2....4....4....2....2....5....1
%e A247539 ..0....5....4....3....5....4....4....2....5....4....3....2....3....6....0....2
%e A247539 ..1....3....3....5....4....1....3....2....6....5....1....3....1....3....2....6
%e A247539 ..0....2....5....6....5....0....2....1....4....3....0....1....2....5....3....5
%e A247539 ..1....0....6....4....4....3....5....3....5....2....2....2....0....4....5....3
%e A247539 ..2....1....2....5....3....4....0....2....3....0....1....2....1....4....4....4
%K A247539 nonn
%O A247539 1,1
%A A247539 _R. H. Hardin_, Sep 18 2014