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.

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

This page as a plain text file.
%I A301949 #4 Mar 29 2018 12:44:31
%S A301949 5,169,4070,98839,2406169,58609226,1427656268,34776685046,
%T A301949 847137052736,20635714219606,502672812882802,12244789017184793,
%U A301949 298275250691010051,7265794879094161325,176990129491522032721,4311366679215895257906
%N A301949 Number of nX6 0..1 arrays with every element equal to 1, 2 or 3 horizontally or antidiagonally adjacent elements, with upper left element zero.
%C A301949 Column 6 of A301951.
%H A301949 R. H. Hardin, <a href="/A301949/b301949.txt">Table of n, a(n) for n = 1..210</a>
%F A301949 Empirical: a(n) = 33*a(n-1) -194*a(n-2) -715*a(n-3) +7892*a(n-4) -2145*a(n-5) -104797*a(n-6) +126737*a(n-7) +639098*a(n-8) -780482*a(n-9) -2453736*a(n-10) +1736864*a(n-11) +5706799*a(n-12) -506462*a(n-13) -5848822*a(n-14) -644915*a(n-15) +3230474*a(n-16) +509931*a(n-17) -1056960*a(n-18) -144139*a(n-19) +202757*a(n-20) +17729*a(n-21) -20624*a(n-22) -825*a(n-23) +894*a(n-24) +25*a(n-25) -16*a(n-26) for n>28
%e A301949 Some solutions for n=5
%e A301949 ..0..0..1..1..0..1. .0..0..0..0..0..1. .0..0..1..1..1..0. .0..0..0..0..0..0
%e A301949 ..0..0..0..0..1..0. .0..1..1..0..1..1. .0..0..0..1..0..0. .0..0..1..1..1..1
%e A301949 ..0..1..1..0..0..0. .0..0..1..1..0..0. .0..1..1..1..1..0. .0..0..1..1..0..0
%e A301949 ..0..0..1..1..0..0. .0..0..0..1..0..0. .0..0..1..1..0..0. .0..1..0..1..1..1
%e A301949 ..0..1..0..0..1..1. .0..0..1..1..1..1. .0..1..1..0..1..1. .0..0..1..0..0..0
%Y A301949 Cf. A301951.
%K A301949 nonn
%O A301949 1,1
%A A301949 _R. H. Hardin_, Mar 29 2018