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.

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

This page as a plain text file.
%I A302743 #4 Apr 12 2018 11:23:21
%S A302743 8,128,1652,21625,285613,3778433,50012515,662080634,8765152857,
%T A302743 116041489300,1536272725817,20338725884827,269264599669170,
%U A302743 3564797029819794,47194388320663969,624807045634867762
%N A302743 Number of 4Xn 0..1 arrays with every element equal to 0, 1, 2, 3 or 4 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.
%C A302743 Row 4 of A302741.
%H A302743 R. H. Hardin, <a href="/A302743/b302743.txt">Table of n, a(n) for n = 1..210</a>
%F A302743 Empirical: a(n) = 13*a(n-1) +16*a(n-2) -165*a(n-3) -70*a(n-4) +100*a(n-5) -564*a(n-6) +879*a(n-7) -500*a(n-8) +1128*a(n-9) +1340*a(n-10) -448*a(n-11) -182*a(n-12) -314*a(n-13) +12*a(n-14) +2*a(n-15) for n>16
%e A302743 Some solutions for n=5
%e A302743 ..0..0..1..0..1. .0..0..1..1..1. .0..1..1..0..1. .0..1..1..0..1
%e A302743 ..0..1..1..0..1. .0..1..0..0..0. .0..1..0..0..0. .0..0..0..1..1
%e A302743 ..0..0..0..1..0. .1..1..1..0..1. .0..0..1..1..1. .0..1..1..1..0
%e A302743 ..0..1..1..1..1. .0..1..1..1..1. .1..0..0..0..0. .1..1..0..0..1
%Y A302743 Cf. A302741.
%K A302743 nonn
%O A302743 1,1
%A A302743 _R. H. Hardin_, Apr 12 2018