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.

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

This page as a plain text file.
%I A247527 #11 Nov 07 2018 14:42:49
%S A247527 33,45,61,81,105,153,217,297,393,585,841,1161,1545,2313,3337,4617,
%T A247527 6153,9225,13321,18441,24585,36873,53257,73737,98313,147465,213001,
%U A247527 294921,393225,589833,851977,1179657,1572873,2359305,3407881,4718601,6291465
%N A247527 Number of length n+3 0..2 arrays with some disjoint pairs in every consecutive four terms having the same sum.
%H A247527 R. H. Hardin, <a href="/A247527/b247527.txt">Table of n, a(n) for n = 1..210</a>
%F A247527 Empirical: a(n) = a(n-1) + 4*a(n-4) - 4*a(n-5).
%F A247527 Empirical g.f.: x*(33 + 12*x + 16*x^2 + 20*x^3 - 108*x^4) / ((1 - x)*(1 - 2*x^2)*(1 + 2*x^2)). - _Colin Barker_, Nov 07 2018
%e A247527 Some solutions for n=6:
%e A247527 ..2....1....0....2....0....2....0....0....1....1....0....0....2....1....1....2
%e A247527 ..1....0....1....1....1....1....1....1....0....1....2....0....1....2....2....1
%e A247527 ..0....2....0....0....0....1....1....1....2....0....1....1....1....0....2....1
%e A247527 ..1....1....1....1....1....0....0....0....1....2....1....1....2....1....1....2
%e A247527 ..2....1....2....2....2....2....0....0....1....1....2....2....0....1....1....0
%e A247527 ..1....0....1....1....1....1....1....1....2....1....2....2....1....2....0....1
%e A247527 ..2....2....2....0....2....1....1....1....0....2....1....1....1....0....2....1
%e A247527 ..1....1....1....1....1....0....0....0....1....2....1....1....2....1....1....0
%e A247527 ..2....1....0....0....2....2....2....0....1....1....0....0....0....1....1....2
%Y A247527 Column 2 of A247533.
%K A247527 nonn
%O A247527 1,1
%A A247527 _R. H. Hardin_, Sep 18 2014