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.

A302271 Number of 7 X n 0..1 arrays with every element equal to 0, 1, 2 or 3 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.

This page as a plain text file.
%I A302271 #7 Apr 05 2018 04:10:05
%S A302271 64,8192,126162,2727755,49315068,982041385,18964765818,367139778723,
%T A302271 7164671008446,139068565629649,2707332855884141,52711100145391758,
%U A302271 1025817729699289943,19978633136068450415,389042172263675668618
%N A302271 Number of 7 X n 0..1 arrays with every element equal to 0, 1, 2 or 3 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.
%C A302271 Row 7 of A302265.
%H A302271 R. H. Hardin, <a href="/A302271/b302271.txt">Table of n, a(n) for n = 1..210</a>
%e A302271 Some solutions for n=5:
%e A302271   0 0 0 0 0     0 0 0 0 0     0 0 0 0 0     0 0 0 0 0
%e A302271   0 0 1 1 1     0 0 1 1 0     0 0 1 1 1     0 0 1 1 0
%e A302271   1 0 1 0 0     1 0 1 1 0     1 0 1 0 0     1 0 1 0 0
%e A302271   0 1 0 1 0     1 0 0 1 0     1 0 1 1 0     0 0 1 1 0
%e A302271   1 1 0 0 1     1 0 1 1 0     0 0 0 1 0     1 0 1 0 0
%e A302271   1 0 1 0 1     1 0 1 0 1     1 1 0 1 1     0 0 1 0 0
%e A302271   0 1 1 0 1     1 1 0 0 1     0 0 0 0 0     1 1 1 0 0
%Y A302271 Cf. A302265.
%K A302271 nonn
%O A302271 1,1
%A A302271 _R. H. Hardin_, Apr 04 2018