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.

A239160 Number of (7+1)X(n+1) 0..3 arrays with no element equal to all horizontal neighbors or unequal to all vertical neighbors, and new values 0..3 introduced in row major order.

This page as a plain text file.
%I A239160 #6 Jul 23 2025 10:58:20
%S A239160 1639,166531,63961519,18120156500,5469574400477,1628795409782566,
%T A239160 486439997897622259,145186363056322713567,43339017958528994310740,
%U A239160 12936602480737955657135546,3861570524893536530703944116
%N A239160 Number of (7+1)X(n+1) 0..3 arrays with no element equal to all horizontal neighbors or unequal to all vertical neighbors, and new values 0..3 introduced in row major order.
%C A239160 Row 7 of A239155
%H A239160 R. H. Hardin, <a href="/A239160/b239160.txt">Table of n, a(n) for n = 1..42</a>
%e A239160 Some solutions for n=2
%e A239160 ..0..1..0....0..1..0....0..1..2....0..1..2....0..1..2....0..1..0....0..1..0
%e A239160 ..0..1..0....0..1..0....0..1..2....0..1..2....0..1..2....0..1..0....0..1..0
%e A239160 ..2..1..3....2..1..0....0..1..0....0..1..0....0..1..2....2..1..0....1..0..2
%e A239160 ..2..0..3....2..1..2....2..1..0....0..1..0....1..3..2....2..1..3....1..0..2
%e A239160 ..1..0..3....1..0..2....2..1..0....2..1..3....1..3..2....3..0..3....1..2..0
%e A239160 ..1..3..1....1..0..2....0..3..0....2..1..3....3..2..1....3..0..3....3..2..0
%e A239160 ..1..3..1....3..0..1....0..3..2....1..2..1....3..2..1....1..2..0....3..1..2
%e A239160 ..1..3..1....3..0..1....0..3..2....1..2..1....3..2..1....1..2..0....3..1..2
%K A239160 nonn
%O A239160 1,1
%A A239160 _R. H. Hardin_, Mar 11 2014