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.

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

This page as a plain text file.
%I A207655 #8 Jul 22 2025 20:38:16
%S A207655 2,16,84,870,13902,264568,12327618,1144562438,64916691796,
%T A207655 20511370392174,15431327748576322,2046762983891357336,
%U A207655 5203964479172695849850,32433326970178563780859912
%N A207655 Number of n X n 0..1 arrays avoiding 0 0 0 and 1 1 1 horizontally and 0 0 1 and 1 0 0 vertically.
%C A207655 Diagonal of A207661
%e A207655 Some solutions for n=4
%e A207655 ..0..1..0..1....0..1..0..1....0..1..1..0....1..0..1..1....1..0..0..1
%e A207655 ..1..1..0..0....0..0..1..0....0..0..1..1....0..0..1..1....0..1..1..0
%e A207655 ..1..0..0..1....0..1..0..1....0..1..1..0....1..0..1..0....1..0..1..1
%e A207655 ..1..1..0..0....0..1..1..0....0..1..0..1....1..0..0..1....1..1..0..1
%K A207655 nonn
%O A207655 1,1
%A A207655 _R. H. Hardin_ Feb 19 2012