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.

A302512 Number of nX5 0..1 arrays with every element equal to 0, 1, 4 or 5 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.

This page as a plain text file.
%I A302512 #4 Apr 09 2018 09:06:45
%S A302512 8,7,21,36,90,184,376,832,1744,3684,7908,16724,35532,75700,160628,
%T A302512 341460,726132,1542596,3278948,6969732,14811684,31481860,66911620,
%U A302512 142208964,302253508,642403076,1365342212,2901889028,6167616388,13108516100
%N A302512 Number of nX5 0..1 arrays with every element equal to 0, 1, 4 or 5 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.
%C A302512 Column 5 of A302515.
%H A302512 R. H. Hardin, <a href="/A302512/b302512.txt">Table of n, a(n) for n = 1..210</a>
%F A302512 Empirical: a(n) = a(n-1) +6*a(n-3) +2*a(n-5) -12*a(n-6) -4*a(n-7) +8*a(n-9) for n>11
%e A302512 Some solutions for n=5
%e A302512 ..0..1..0..1..0. .0..1..0..0..0. .0..0..0..1..0. .0..0..0..1..0
%e A302512 ..0..1..0..1..0. .0..1..0..1..0. .0..1..0..1..0. .0..1..0..1..0
%e A302512 ..0..1..1..0..0. .0..1..1..1..0. .0..1..0..1..0. .0..1..0..1..0
%e A302512 ..0..1..0..1..0. .0..1..0..0..0. .0..1..0..1..0. .0..1..0..1..0
%e A302512 ..0..1..0..1..0. .0..1..0..1..1. .0..1..0..1..0. .0..1..1..1..0
%Y A302512 Cf. A302515.
%K A302512 nonn
%O A302512 1,1
%A A302512 _R. H. Hardin_, Apr 09 2018