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.

A302213 Number of 3Xn 0..1 arrays with every element equal to 0, 2 or 3 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.

This page as a plain text file.
%I A302213 #4 Apr 03 2018 12:02:36
%S A302213 4,2,16,5,32,22,72,101,216,486,968,2541,5598,14718,35506,91947,231984,
%T A302213 597758,1533828,3954067,10201602,26336704,68062810,175893407,
%U A302213 454813604,1176002162,3041473404,7866219629,20346282584,52627527962,136129978706
%N A302213 Number of 3Xn 0..1 arrays with every element equal to 0, 2 or 3 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.
%C A302213 Row 3 of A302212.
%H A302213 R. H. Hardin, <a href="/A302213/b302213.txt">Table of n, a(n) for n = 1..210</a>
%F A302213 Empirical: a(n) = 4*a(n-1) +4*a(n-2) -29*a(n-3) -3*a(n-4) +96*a(n-5) -14*a(n-6) -187*a(n-7) +39*a(n-8) +246*a(n-9) -52*a(n-10) -230*a(n-11) +48*a(n-12) +146*a(n-13) -29*a(n-14) -57*a(n-15) +9*a(n-16) +12*a(n-17) -a(n-18) -a(n-19) for n>20
%e A302213 Some solutions for n=5
%e A302213 ..0..1..1..0..1. .0..1..0..0..0. .0..0..0..1..0. .0..0..1..1..0
%e A302213 ..0..1..1..0..1. .1..1..1..0..1. .1..0..1..1..1. .1..0..0..1..1
%e A302213 ..1..1..0..0..0. .0..1..1..0..1. .1..0..1..1..0. .0..0..1..1..0
%Y A302213 Cf. A302212.
%K A302213 nonn
%O A302213 1,1
%A A302213 _R. H. Hardin_, Apr 03 2018