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.

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

This page as a plain text file.
%I A300179 #4 Feb 27 2018 12:30:31
%S A300179 16,512,16208,513832,16288960,516368256,16369174784,518912313824,
%T A300179 16449820393120,521468820137344,16530863182211264,524037923251710208,
%U A300179 16612305236616613760,526619683480028961920,16694148528966490951424
%N A300179 Number of nX5 0..1 arrays with every element equal to 0, 1, 2, 3, 4, 5, 6 or 7 king-move adjacent elements, with upper left element zero.
%C A300179 Column 5 of A300182.
%H A300179 R. H. Hardin, <a href="/A300179/b300179.txt">Table of n, a(n) for n = 1..210</a>
%F A300179 Empirical: a(n) = 26*a(n-1) +158*a(n-2) +696*a(n-3) +756*a(n-4) +236*a(n-5) -3520*a(n-6) -640*a(n-7) -1792*a(n-8) +4096*a(n-9)
%e A300179 Some solutions for n=5
%e A300179 ..0..0..0..0..0. .0..0..0..0..0. .0..0..0..0..0. .0..0..0..0..0
%e A300179 ..0..0..0..0..0. .0..0..0..0..0. .0..0..0..1..0. .0..0..0..0..1
%e A300179 ..0..0..1..0..0. .1..0..1..0..1. .0..1..0..1..1. .1..0..1..1..0
%e A300179 ..1..1..1..1..1. .0..1..0..0..0. .0..1..0..1..0. .1..0..1..0..1
%e A300179 ..1..1..1..0..0. .0..0..0..0..1. .0..0..0..1..1. .1..0..1..0..1
%Y A300179 Cf. A300182.
%K A300179 nonn
%O A300179 1,1
%A A300179 _R. H. Hardin_, Feb 27 2018