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.

A208635 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 one of its immediate leftward or upward or right-upward antidiagonal neighbors.

This page as a plain text file.
%I A208635 #8 Jul 05 2018 08:44:18
%S A208635 32,95,309,1042,3577,12404,43284,151656,532795,1875161,6607478,
%T A208635 23301225,82215220,290187784,1024490960,3617470935,12774594765,
%U A208635 45114821146,159335044937,562751474084,1987608261228,7020221345560,24795605196403
%N A208635 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 one of its immediate leftward or upward or right-upward antidiagonal neighbors.
%C A208635 Column 6 of A208637.
%H A208635 R. H. Hardin, <a href="/A208635/b208635.txt">Table of n, a(n) for n = 1..210</a>
%F A208635 Empirical: a(n) = 7*a(n-1) - 15*a(n-2) + 10*a(n-3) - a(n-4).
%F A208635 Empirical g.f.: x*(32 - 129*x + 124*x^2 - 16*x^3) / ((1 - x)*(1 - 6*x + 9*x^2 - x^3)). - _Colin Barker_, Jul 05 2018
%e A208635 Some solutions for n=4:
%e A208635 ..0..1..1..0..1..0....0..0..1..0..0..0....0..0..1..0..0..1....0..0..0..1..0..0
%e A208635 ..1..0..1..0..1..1....1..0..1..1..1..0....1..0..1..1..0..0....1..1..0..1..1..0
%e A208635 ..0..1..0..1..0..0....1..0..0..0..1..0....1..0..0..1..1..0....0..1..0..0..1..1
%e A208635 ..0..1..0..1..1..1....0..1..1..0..1..1....1..1..0..0..1..0....1..0..1..0..0..0
%Y A208635 Cf. A208637.
%K A208635 nonn
%O A208635 1,1
%A A208635 _R. H. Hardin_, Feb 29 2012