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.

A207387 Number of n X n 0..1 arrays avoiding 0 0 1 and 0 1 0 horizontally and 0 0 1 and 1 1 0 vertically.

This page as a plain text file.
%I A207387 #8 Jul 22 2025 20:21:32
%S A207387 2,16,98,643,5348,42167,335915,2975974,27237128,254712604,2518233755,
%T A207387 25906520150,274611244775,3028044205471,34585700854386
%N A207387 Number of n X n 0..1 arrays avoiding 0 0 1 and 0 1 0 horizontally and 0 0 1 and 1 1 0 vertically.
%C A207387 Diagonal of A207391
%e A207387 Some solutions for n=4
%e A207387 ..1..0..1..1....0..1..1..1....1..0..1..1....1..0..0..0....0..1..1..0
%e A207387 ..0..1..1..0....0..0..0..0....1..0..1..1....0..1..1..0....0..0..0..0
%e A207387 ..1..1..1..1....0..1..1..0....1..0..1..1....1..0..0..0....0..1..1..0
%e A207387 ..0..1..1..1....0..0..0..0....1..0..1..1....1..1..1..0....0..1..1..0
%K A207387 nonn
%O A207387 1,1
%A A207387 _R. H. Hardin_ Feb 17 2012