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.

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

This page as a plain text file.
%I A302666 #4 Apr 11 2018 11:56:58
%S A302666 2,45,164,934,4267,21949,106793,529984,2617548,12938179,63986777,
%T A302666 316244862,1563877465,7731246308,38227036552,188999363652,
%U A302666 934471931880,4620268994057,22843909984025,112946725741085,558440468796391
%N A302666 Number of nX4 0..1 arrays with every element equal to 1, 2, 3 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.
%C A302666 Column 4 of A302670.
%H A302666 R. H. Hardin, <a href="/A302666/b302666.txt">Table of n, a(n) for n = 1..210</a>
%F A302666 Empirical: a(n) = 5*a(n-1) +12*a(n-2) -47*a(n-3) -101*a(n-4) +45*a(n-5) +381*a(n-6) +1292*a(n-7) +42*a(n-8) -5366*a(n-9) -7123*a(n-10) +6047*a(n-11) +22989*a(n-12) +15537*a(n-13) -22434*a(n-14) -51326*a(n-15) -29224*a(n-16) +38509*a(n-17) +82591*a(n-18) +44309*a(n-19) -44268*a(n-20) -87403*a(n-21) -42575*a(n-22) +28053*a(n-23) +52051*a(n-24) +24821*a(n-25) -7290*a(n-26) -13614*a(n-27) -6288*a(n-28) +190*a(n-29) +1280*a(n-30) +312*a(n-31) +20*a(n-32) for n>35
%e A302666 Some solutions for n=5
%e A302666 ..0..0..1..1. .0..0..1..1. .0..0..1..1. .0..0..0..1. .0..1..1..0
%e A302666 ..0..1..1..0. .0..0..0..0. .1..1..0..1. .1..1..1..1. .1..0..0..1
%e A302666 ..1..0..0..1. .1..1..1..1. .1..0..0..0. .1..0..0..0. .1..1..0..0
%e A302666 ..0..0..1..1. .0..0..0..0. .1..0..1..1. .0..1..1..0. .0..1..0..1
%e A302666 ..0..0..1..1. .1..1..1..0. .0..1..0..0. .1..1..0..0. .0..0..1..0
%Y A302666 Cf. A302670.
%K A302666 nonn
%O A302666 1,1
%A A302666 _R. H. Hardin_, Apr 11 2018