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.

A208710 Number of 3 X n 0..1 arrays with new values 0..1 introduced in row major order and no element equal to more than two of its immediate leftward or upward or right-upward antidiagonal neighbors.

This page as a plain text file.
%I A208710 #12 Jul 07 2018 01:38:31
%S A208710 4,32,196,1268,8128,52184,334948,2149988,13800400,88582472,568596052,
%T A208710 3649722932,23426960800,150373741496,965223885508,6195610615940,
%U A208710 39768587869168,255267911291816,1638522010126516,10517398618896212
%N A208710 Number of 3 X n 0..1 arrays with new values 0..1 introduced in row major order and no element equal to more than two of its immediate leftward or upward or right-upward antidiagonal neighbors.
%C A208710 Row 3 of A208709.
%H A208710 R. H. Hardin, <a href="/A208710/b208710.txt">Table of n, a(n) for n = 1..210</a>
%F A208710 Empirical: a(n) = 5*a(n-1) + 9*a(n-2) + a(n-3) - 2*a(n-4).
%F A208710 Empirical g.f.: 4*x*(1 + 3*x - x^3) / ((1 + x)*(1 - 6*x - 3*x^2 + 2*x^3)). - _Colin Barker_, Jul 06 2018
%e A208710 Some solutions for n=4:
%e A208710   0 0 0 1     0 0 1 0     0 1 0 1     0 1 1 0     0 0 1 0
%e A208710   0 1 0 1     0 0 1 1     0 1 0 0     1 0 0 1     1 1 1 0
%e A208710   1 0 0 1     1 0 0 0     0 1 1 0     1 0 1 1     0 1 0 0
%Y A208710 Cf. A208709.
%K A208710 nonn
%O A208710 1,1
%A A208710 _R. H. Hardin_, Mar 01 2012