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.

A208707 Number of n X 6 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 A208707 #9 Jul 06 2018 08:11:44
%S A208707 32,1268,52184,2142580,87985748,3613193828,148378294612,6093257064980,
%T A208707 250223806647572,10275613313012692,421975152458430164,
%U A208707 17328700863708613076,711615060447141699796,29222963581518749645012
%N A208707 Number of n X 6 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 A208707 Column 6 of A208709.
%H A208707 R. H. Hardin, <a href="/A208707/b208707.txt">Table of n, a(n) for n = 1..210</a>
%F A208707 Empirical: a(n) = 45*a(n-1) - 168*a(n-2) + 272*a(n-3) - 324*a(n-4) + 240*a(n-5) - 64*a(n-6) for n>7.
%F A208707 Empirical g.f.: 4*x*(8 - 43*x + 125*x^2 - 345*x^3 + 508*x^4 - 572*x^5 + 400*x^6) / ((1 - x)*(1 - 44*x + 124*x^2 - 148*x^3 + 176*x^4 - 64*x^5)). - _Colin Barker_, Jul 06 2018
%e A208707 Some solutions for n=4:
%e A208707 ..0..0..1..0..1..1....0..0..0..0..0..1....0..0..0..1..0..1....0..0..0..1..0..0
%e A208707 ..0..0..0..0..1..0....1..0..1..0..1..1....1..0..1..1..0..1....0..1..1..0..1..1
%e A208707 ..1..0..1..0..0..1....1..1..1..1..0..1....0..0..1..0..1..1....0..1..0..0..0..1
%e A208707 ..1..0..1..0..1..0....0..1..0..0..1..0....1..0..0..1..0..0....0..1..1..0..1..0
%Y A208707 Cf. A208709.
%K A208707 nonn
%O A208707 1,1
%A A208707 _R. H. Hardin_, Mar 01 2012