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.

A298914 Number of n X 5 0..1 arrays with every element equal to 0, 3, 5, 7 or 8 king-move adjacent elements, with upper left element zero.

This page as a plain text file.
%I A298914 #7 Sep 04 2022 13:17:50
%S A298914 1,3,3,4,7,9,15,26,46,84,151,276,506,929,1708,3138,5770,10611,19515,
%T A298914 35893,66014,121417,223319,410746,755479,1389539,2555759,4700772,
%U A298914 8646066,15902594,29249427,53798082,98950098,181997603,334745780,615693476
%N A298914 Number of n X 5 0..1 arrays with every element equal to 0, 3, 5, 7 or 8 king-move adjacent elements, with upper left element zero.
%C A298914 Column 5 of A298917.
%H A298914 R. H. Hardin, <a href="/A298914/b298914.txt">Table of n, a(n) for n = 1..210</a>
%F A298914 Empirical: a(n) = a(n-1) +a(n-2) +a(n-3) +a(n-5) -a(n-6) -a(n-7) -a(n-8) for n>9.
%e A298914 Some solutions for n=5
%e A298914 ..0..0..1..1..1. .0..0..0..1..1. .0..0..0..0..0. .0..0..0..0..0
%e A298914 ..0..0..1..1..1. .0..0..0..1..1. .0..0..0..0..0. .0..0..0..0..0
%e A298914 ..0..0..1..1..1. .0..0..0..1..1. .0..0..0..0..0. .0..0..0..0..0
%e A298914 ..0..0..1..1..1. .0..0..0..1..1. .1..1..1..1..1. .0..0..0..0..0
%e A298914 ..0..0..1..1..1. .0..0..0..1..1. .1..1..1..1..1. .0..0..0..0..0
%Y A298914 Cf. A298917.
%K A298914 nonn
%O A298914 1,2
%A A298914 _R. H. Hardin_, Jan 29 2018