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.

A300367 Number of nX3 0..1 arrays with every element equal to 2 or 3 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.

This page as a plain text file.
%I A300367 #4 Mar 04 2018 09:06:13
%S A300367 0,1,0,3,3,8,16,32,70,135,293,585,1221,2496,5156,10609,21818,44955,
%T A300367 92476,190459,391929,806935,1660946,3419147,7038323,14488296,29824518,
%U A300367 61393333,126379174,260151058,535522942,1102374986,2269243610,4671246404
%N A300367 Number of nX3 0..1 arrays with every element equal to 2 or 3 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.
%C A300367 Column 3 of A300372.
%H A300367 R. H. Hardin, <a href="/A300367/b300367.txt">Table of n, a(n) for n = 1..210</a>
%F A300367 Empirical: a(n) = a(n-2) +2*a(n-3) +5*a(n-4) +6*a(n-5) +4*a(n-6) +6*a(n-7) +a(n-8) -a(n-12) +2*a(n-13) -a(n-14)
%e A300367 All solutions for n=5
%e A300367 ..0..0..0. .0..0..1. .0..0..1
%e A300367 ..0..1..0. .0..1..1. .0..1..1
%e A300367 ..1..1..0. .0..0..0. .1..0..0
%e A300367 ..0..0..1. .1..1..0. .1..0..1
%e A300367 ..0..1..1. .1..0..0. .1..1..1
%Y A300367 Cf. A300372.
%K A300367 nonn
%O A300367 1,4
%A A300367 _R. H. Hardin_, Mar 04 2018