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.

A220934 Equals two maps: number of nX5 binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal and antidiagonal neighbors in a random 0..2 nX5 array.

This page as a plain text file.
%I A220934 #6 Jul 23 2025 01:33:09
%S A220934 7,200,5912,172904,4983202,143495572,4129000493,118791182035,
%T A220934 3417440488681,98313052773312,2828261800424005,81363108971612428,
%U A220934 2340643785326878730,67335342944117783361,1937094540263542667587
%N A220934 Equals two maps: number of nX5 binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal and antidiagonal neighbors in a random 0..2 nX5 array.
%C A220934 Column 5 of A220935
%H A220934 R. H. Hardin, <a href="/A220934/b220934.txt">Table of n, a(n) for n = 1..16</a>
%e A220934 Some solutions for n=3
%e A220934 ..0..1..0..1..1....0..0..1..0..0....0..1..1..0..0....0..0..0..0..1
%e A220934 ..0..0..0..0..1....1..1..1..0..0....1..0..0..0..0....0..1..0..0..1
%e A220934 ..0..1..1..1..0....0..0..1..1..0....0..0..0..1..0....0..0..0..1..0
%K A220934 nonn
%O A220934 1,1
%A A220934 _R. H. Hardin_ Dec 25 2012