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.

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

This page as a plain text file.
%I A299648 #6 Jun 15 2020 14:49:20
%S A299648 1,8,247,29408,13431706,23582064542,159047224409362,
%T A299648 4121184916626976747,410254820466598294243538,
%U A299648 156900221075811012583120150328,230531929217067955283511588326278811
%N A299648 Number of n X n 0..1 arrays with every element equal to 0, 1, 2, 3, 4, 5 or 6 king-move adjacent elements, with upper left element zero.
%C A299648 Diagonal of A299654.
%e A299648 Some solutions for n=5
%e A299648 ..0..0..0..0..0. .0..0..0..0..0. .0..0..0..0..0. .0..0..0..0..0
%e A299648 ..0..0..1..0..1. .0..0..0..1..0. .0..0..1..0..1. .0..0..1..1..0
%e A299648 ..1..0..0..1..0. .0..1..1..0..0. .1..0..1..1..0. .0..0..1..0..0
%e A299648 ..1..0..0..1..0. .0..1..1..0..1. .0..0..1..0..1. .1..1..0..0..0
%e A299648 ..0..0..1..1..0. .1..0..0..0..1. .1..0..0..1..1. .0..0..1..1..0
%Y A299648 Cf. A299654.
%K A299648 nonn
%O A299648 1,2
%A A299648 _R. H. Hardin_, Feb 15 2018