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.

A300180 Number of nX6 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 A300180 #4 Feb 27 2018 12:31:14
%S A300180 32,2048,129217,8168705,516368256,32640586945,2063278351093,
%T A300180 130424025161538,8244367994118153,521143277869649643,
%U A300180 32942527085459429442,2082364172855562710821,131630476835565158890163
%N A300180 Number of nX6 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 A300180 Column 6 of A300182.
%H A300180 R. H. Hardin, <a href="/A300180/b300180.txt">Table of n, a(n) for n = 1..210</a>
%F A300180 Empirical: a(n) = 52*a(n-1) +613*a(n-2) +5871*a(n-3) +11376*a(n-4) +9186*a(n-5) -411458*a(n-6) +66088*a(n-7) -1386895*a(n-8) +8059846*a(n-9) -4373944*a(n-10) +14457696*a(n-11) -42895616*a(n-12) +12292096*a(n-13) -11452416*a(n-14) +15335424*a(n-15)
%e A300180 Some solutions for n=5
%e A300180 ..0..0..0..0..1..0. .0..0..0..0..1..1. .0..0..0..1..1..0. .0..0..0..0..1..1
%e A300180 ..0..0..1..0..0..0. .0..0..0..0..1..1. .0..0..0..1..0..0. .0..0..1..0..1..1
%e A300180 ..0..0..0..1..0..1. .0..0..1..1..0..1. .0..0..1..0..1..0. .0..0..0..1..1..0
%e A300180 ..0..0..0..1..1..1. .0..0..0..1..1..1. .0..0..0..0..1..0. .0..0..0..1..0..1
%e A300180 ..0..0..1..0..0..0. .0..0..0..0..1..1. .0..0..0..0..1..1. .0..0..1..0..0..1
%Y A300180 Cf. A300182.
%K A300180 nonn
%O A300180 1,1
%A A300180 _R. H. Hardin_, Feb 27 2018