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.

A302428 Number of 3 X n 0..1 arrays with every element equal to 0, 1, 3 or 5 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.

This page as a plain text file.
%I A302428 #6 Mar 23 2023 07:51:36
%S A302428 4,6,11,21,38,88,188,377,735,1557,3288,6781,13628,28203,58716,121753,
%T A302428 248505,511788,1057997,2191020,4502367,9272331,19120457,39518063,
%U A302428 81408758,167766247,345763679,713697958,1471345608,3033391563,6252203749
%N A302428 Number of 3 X n 0..1 arrays with every element equal to 0, 1, 3 or 5 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.
%C A302428 Row 3 of A302427.
%H A302428 R. H. Hardin, <a href="/A302428/b302428.txt">Table of n, a(n) for n = 1..210</a>
%F A302428 Empirical: a(n) = a(n-1) +a(n-2) -a(n-3) +12*a(n-4) -5*a(n-5) -7*a(n-6) +2*a(n-7) -26*a(n-8) +7*a(n-9) +14*a(n-10) -2*a(n-11) +18*a(n-12) -3*a(n-13) -9*a(n-14) +a(n-15) -3*a(n-16) +a(n-18) for n>19.
%e A302428 Some solutions for n=5
%e A302428 ..0..1..0..1..0. .0..1..0..1..0. .0..1..0..1..0. .0..0..0..1..0
%e A302428 ..0..1..0..1..0. .0..1..1..1..0. .0..1..0..1..0. .0..1..1..1..0
%e A302428 ..0..0..1..1..0. .0..0..0..1..0. .0..1..1..0..0. .0..1..0..1..0
%Y A302428 Cf. A302427.
%K A302428 nonn
%O A302428 1,1
%A A302428 _R. H. Hardin_, Apr 07 2018