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.

A298966 Number of nX4 0..1 arrays with every element equal to 0, 1, 2, 3, 4 or 5 king-move adjacent elements, with upper left element zero.

This page as a plain text file.
%I A298966 #4 Jan 30 2018 13:28:32
%S A298966 8,128,1575,21098,280468,3740381,49885231,665351771,8874346832,
%T A298966 118364863862,1578735453349,21056975599629,280855308864195,
%U A298966 3746013029750793,49963853976933385,666411644915463676
%N A298966 Number of nX4 0..1 arrays with every element equal to 0, 1, 2, 3, 4 or 5 king-move adjacent elements, with upper left element zero.
%C A298966 Column 4 of A298970.
%H A298966 R. H. Hardin, <a href="/A298966/b298966.txt">Table of n, a(n) for n = 1..210</a>
%F A298966 Empirical: a(n) = 13*a(n-1) +11*a(n-2) -67*a(n-3) -264*a(n-4) -64*a(n-5) +1260*a(n-6) +656*a(n-7) -3045*a(n-8) -3423*a(n-9) +5088*a(n-10) +9482*a(n-11) -514*a(n-12) -10331*a(n-13) -6164*a(n-14) +3337*a(n-15) +4293*a(n-16) +719*a(n-17) -809*a(n-18) +116*a(n-19) +149*a(n-20) -62*a(n-21) -160*a(n-22) -48*a(n-23)
%e A298966 Some solutions for n=5
%e A298966 ..0..0..0..1. .0..0..0..1. .0..0..1..0. .0..0..0..1. .0..0..0..1
%e A298966 ..1..0..1..1. .1..0..0..1. .0..1..1..1. .0..1..0..1. .0..1..1..1
%e A298966 ..0..1..0..1. .0..1..1..0. .0..0..1..1. .1..0..1..0. .1..1..1..0
%e A298966 ..0..0..1..1. .1..0..0..1. .0..0..1..0. .1..1..0..0. .1..0..0..0
%e A298966 ..1..1..1..0. .1..0..0..1. .0..1..1..0. .1..1..0..1. .1..0..1..0
%Y A298966 Cf. A298970.
%K A298966 nonn
%O A298966 1,1
%A A298966 _R. H. Hardin_, Jan 30 2018