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.

A183765 1/32 the number of (2n+1) X (2n+1) binary arrays with equal numbers of 2 X 2 subblocks with sum mod two being 0 and 1.

This page as a plain text file.
%I A183765 #7 Jan 14 2017 01:53:10
%S A183765 6,205920,2323234636800,7506428481300850827264,
%T A183765 6612015156138094974390271820169216
%N A183765 1/32 the number of (2n+1) X (2n+1) binary arrays with equal numbers of 2 X 2 subblocks with sum mod two being 0 and 1.
%C A183765 Diagonal A183772(2n,2n).
%e A183765 Some solutions for 3 X 3:
%e A183765 ..0..0..1....1..1..1....1..1..0....0..0..0....0..0..0....1..0..1....0..0..0
%e A183765 ..1..1..0....0..1..1....0..1..1....0..1..0....1..1..0....1..1..0....0..0..0
%e A183765 ..1..0..0....1..0..1....0..1..1....1..0..1....1..0..1....1..1..1....0..1..0
%K A183765 nonn
%O A183765 1,1
%A A183765 _R. H. Hardin_, Jan 06 2011

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.