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.

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

This page as a plain text file.
%I A299448 #6 Apr 17 2023 15:24:29
%S A299448 8,32,10,32,231,163,546,2904,2321,8729,37095,34873,133308,479406,
%T A299448 532460,2010313,6292009,8198893,30089392,84206120,126909538,448256806,
%U A299448 1150937204,1973045921,6665452062,16078638245,30784208565,99193604275
%N A299448 Number of n X 5 0..1 arrays with every element equal to 0, 1, 3, 5, 6 or 8 king-move adjacent elements, with upper left element zero.
%C A299448 Column 5 of A299451.
%H A299448 R. H. Hardin, <a href="/A299448/b299448.txt">Table of n, a(n) for n = 1..210</a>
%e A299448 Some solutions for n=5
%e A299448 ..0..1..0..1..1. .0..0..1..1..0. .0..1..0..1..1. .0..1..1..0..0
%e A299448 ..1..0..0..0..0. .0..0..1..1..0. .0..1..0..1..1. .1..0..1..1..1
%e A299448 ..1..1..1..1..1. .0..0..0..0..0. .0..0..0..1..1. .0..0..1..1..1
%e A299448 ..1..0..1..0..0. .1..1..0..0..1. .0..1..0..1..1. .1..0..1..1..1
%e A299448 ..0..1..1..1..1. .0..0..0..1..0. .0..1..0..1..1. .0..1..1..0..0
%Y A299448 Cf. A299451.
%K A299448 nonn
%O A299448 1,1
%A A299448 _R. H. Hardin_, Feb 10 2018