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.

A301963 Number of n X 7 0..1 arrays with every element equal to 0, 1 or 4 horizontally or antidiagonally adjacent elements, with upper left element zero.

This page as a plain text file.
%I A301963 #6 Mar 24 2023 10:01:35
%S A301963 21,35,132,443,1803,7795,33860,148299,646838,2827081,12348295,
%T A301963 53946658,235669276,1029543928,4497666250,19648472006,85836276153,
%U A301963 374983965881,1638153628134,7156431645355,31263560215566,136577871103739
%N A301963 Number of n X 7 0..1 arrays with every element equal to 0, 1 or 4 horizontally or antidiagonally adjacent elements, with upper left element zero.
%C A301963 Column 7 of A301964.
%H A301963 R. H. Hardin, <a href="/A301963/b301963.txt">Table of n, a(n) for n = 1..210</a>
%F A301963 Empirical: a(n) = a(n-1) +13*a(n-2) +13*a(n-3) -19*a(n-4) -27*a(n-5) +16*a(n-6) +32*a(n-7) -23*a(n-8) -43*a(n-9) +45*a(n-10) +11*a(n-11) -29*a(n-12) +13*a(n-13) -2*a(n-14) for n>17.
%e A301963 Some solutions for n=5
%e A301963 ..0..0..1..0..1..0..1. .0..0..1..0..1..0..1. .0..0..1..1..0..1..0
%e A301963 ..1..0..1..0..1..0..1. .1..0..0..0..1..1..1. .1..0..0..1..0..1..0
%e A301963 ..1..0..1..0..1..1..1. .1..0..1..0..1..0..0. .1..1..0..1..1..1..0
%e A301963 ..1..1..1..0..1..0..1. .1..0..0..0..1..1..0. .0..0..0..1..0..1..1
%e A301963 ..1..0..1..0..1..0..1. .1..0..1..0..0..1..1. .0..1..0..1..0..0..1
%Y A301963 Cf. A301964.
%K A301963 nonn
%O A301963 1,1
%A A301963 _R. H. Hardin_, Mar 29 2018