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.

A183443 Number of n X n binary arrays with every 1 having exactly two king-move neighbors equal to 1.

This page as a plain text file.
%I A183443 #8 Jun 02 2025 03:17:13
%S A183443 1,5,18,72,2054,53608,1744887,216103851,39184763856,11314547102638,
%T A183443 7873316318240100,9711485486581483616,21262647899259681841579
%N A183443 Number of n X n binary arrays with every 1 having exactly two king-move neighbors equal to 1.
%C A183443 Diagonal of A183450
%e A183443 Some solutions for 5X5
%e A183443 ..0..0..0..0..0....0..0..0..1..0....0..0..1..0..0....0..1..0..0..0
%e A183443 ..1..0..0..0..0....0..1..1..0..1....0..1..0..1..0....1..1..0..1..0
%e A183443 ..1..1..0..1..1....1..0..0..0..1....1..0..0..0..1....0..0..0..1..1
%e A183443 ..0..0..0..0..1....1..0..0..0..1....1..0..0..0..1....1..1..0..0..0
%e A183443 ..0..0..0..0..0....0..1..1..1..0....0..1..1..1..0....0..1..0..0..0
%K A183443 nonn
%O A183443 1,2
%A A183443 _R. H. Hardin_ Jan 04 2011