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.

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

This page as a plain text file.
%I A299734 #6 Jun 15 2020 14:54:42
%S A299734 1,8,220,21111,6896530,7790212998,30260326859957,404132235613627376,
%T A299734 18556239226034408691425
%N A299734 Number of n X n 0..1 arrays with every element equal to 0, 1, 2, 3, 4, 5 or 8 king-move adjacent elements, with upper left element zero.
%C A299734 Diagonal of A299740.
%e A299734 Some solutions for n=5
%e A299734 ..0..0..0..0..0. .0..0..0..0..0. .0..0..0..0..0. .0..0..0..0..0
%e A299734 ..0..0..1..1..1. .0..1..1..0..1. .0..0..0..0..0. .0..1..1..0..1
%e A299734 ..1..0..1..1..1. .0..0..1..1..0. .0..0..0..0..0. .0..0..1..1..0
%e A299734 ..0..0..1..1..1. .1..1..1..0..1. .1..1..1..1..1. .1..1..0..1..1
%e A299734 ..0..1..0..0..0. .0..1..0..0..0. .1..0..1..0..0. .1..0..0..1..0
%Y A299734 Cf. A299740.
%K A299734 nonn
%O A299734 1,2
%A A299734 _R. H. Hardin_, Feb 18 2018