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.

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

This page as a plain text file.
%I A303458 #4 Apr 24 2018 10:23:57
%S A303458 8,128,1696,22756,306448,4129588,55681352,750838628,10125474040,
%T A303458 136549176292,1841478572144,24833903347572,334906650542448,
%U A303458 4516506726074020,60909019475694136,821411104147953668
%N A303458 Number of 4Xn 0..1 arrays with every element equal to 0, 1, 2, 3, 4 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.
%C A303458 Row 4 of A303456.
%H A303458 R. H. Hardin, <a href="/A303458/b303458.txt">Table of n, a(n) for n = 1..210</a>
%F A303458 Empirical: a(n) = 14*a(n-1) +18*a(n-2) -338*a(n-3) -62*a(n-4) +1192*a(n-5) -648*a(n-6) +1818*a(n-7) +1407*a(n-8) -3144*a(n-9) +3656*a(n-10) -8832*a(n-11) -7324*a(n-12) +8010*a(n-13) +2202*a(n-14) +3312*a(n-15) for n>16
%e A303458 Some solutions for n=5
%e A303458 ..0..0..1..0..0. .0..0..0..0..0. .0..1..0..1..1. .0..1..0..0..1
%e A303458 ..0..1..1..1..1. .0..1..0..1..0. .0..0..1..1..1. .0..1..0..0..0
%e A303458 ..0..1..1..0..0. .0..1..1..0..1. .1..0..0..0..0. .0..0..0..1..1
%e A303458 ..0..0..1..1..1. .0..0..1..1..0. .0..0..1..1..0. .1..0..1..1..1
%Y A303458 Cf. A303456.
%K A303458 nonn
%O A303458 1,1
%A A303458 _R. H. Hardin_, Apr 24 2018