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.

A262270 Number of (n+2)X(4+2) 0..1 arrays with each row and column divisible by 5, read as a binary number with top and left being the most significant bits.

This page as a plain text file.
%I A262270 #4 Sep 17 2015 08:19:49
%S A262270 13,169,585,3253,37061,467065,4403641,49793329,628659565,8114855785,
%T A262270 100698388425,1284102518917,16612868083733,215733029771449,
%U A262270 2784755393197465,36096259647083761,468882349083176077
%N A262270 Number of (n+2)X(4+2) 0..1 arrays with each row and column divisible by 5, read as a binary number with top and left being the most significant bits.
%C A262270 Column 4 of A262274.
%H A262270 R. H. Hardin, <a href="/A262270/b262270.txt">Table of n, a(n) for n = 1..210</a>
%e A262270 Some solutions for n=4
%e A262270 ..1..1..1..1..0..0....0..0..0..0..0..0....0..0..0..1..0..1....1..0..1..0..0..0
%e A262270 ..0..1..1..1..1..0....1..1..0..0..1..0....0..0..0..1..0..1....0..0..0..0..0..0
%e A262270 ..0..0..0..0..0..0....1..1..0..1..1..1....0..0..0..0..0..0....1..0..1..1..0..1
%e A262270 ..0..1..1..1..1..0....0..0..0..0..0..0....1..0..1..1..0..1....0..0..0..0..0..0
%e A262270 ..1..1..1..1..0..0....0..0..0..1..0..1....0..0..0..1..0..1....0..0..0..1..0..1
%e A262270 ..1..1..1..1..0..0....1..1..0..0..1..0....1..0..1..1..0..1....0..0..0..0..0..0
%Y A262270 Cf. A262274.
%K A262270 nonn
%O A262270 1,1
%A A262270 _R. H. Hardin_, Sep 17 2015