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.

A279157 Number of nX7 0..1 arrays with no element equal to a strict majority of its king-move neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.

This page as a plain text file.
%I A279157 #4 Dec 06 2016 22:56:58
%S A279157 15,162,2903,60304,1331471,26724386,517476726,10025433990,
%T A279157 191191601644,3592564336954,66997045991457,1240581415395934,
%U A279157 22812879393607545,417195888212408920,7594010221332762302,137646990170206088748
%N A279157 Number of nX7 0..1 arrays with no element equal to a strict majority of its king-move neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.
%C A279157 Column 7 of A279158.
%H A279157 R. H. Hardin, <a href="/A279157/b279157.txt">Table of n, a(n) for n = 1..100</a>
%e A279157 Some solutions for n=4
%e A279157 ..0..1..0..0..1..0..1. .0..1..0..0..0..1..0. .0..1..1..0..1..0..1
%e A279157 ..0..1..0..1..1..0..1. .0..1..1..1..1..0..1. .1..0..0..1..1..0..1
%e A279157 ..0..1..0..0..1..0..0. .0..1..0..0..1..0..1. .1..0..0..0..0..1..0
%e A279157 ..1..0..1..0..1..0..1. .0..1..1..1..0..1..0. .0..1..1..1..0..1..0
%Y A279157 Cf. A279158.
%K A279157 nonn
%O A279157 1,1
%A A279157 _R. H. Hardin_, Dec 06 2016