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.

A266185 Number of 4Xn arrays containing n copies of 0..4-1 with no element plus any diagonal or antidiagonal neighbor equal to 4-1.

This page as a plain text file.
%I A266185 #6 Aug 12 2016 06:53:59
%S A266185 24,384,7768,226296,7089448,253282792,9451853336,371640077992,
%T A266185 15004890740488,621421685721976,26174574774860264,1119055728709553688,
%U A266185 48396501869679377480,2113991818229740211832,93107795487773857584184
%N A266185 Number of 4Xn arrays containing n copies of 0..4-1 with no element plus any diagonal or antidiagonal neighbor equal to 4-1.
%C A266185 Row 4 of A266183.
%H A266185 R. H. Hardin, <a href="/A266185/b266185.txt">Table of n, a(n) for n = 1..16</a>
%e A266185 Some solutions for n=3
%e A266185 ..2..1..2....3..1..2....0..0..2....3..1..0....2..3..2....1..3..0....1..3..1
%e A266185 ..0..3..0....1..3..0....1..0..2....0..2..0....1..0..3....2..0..3....3..3..2
%e A266185 ..3..2..1....3..1..2....2..3..1....2..1..2....1..3..0....0..3..2....1..2..2
%e A266185 ..3..1..0....0..2..0....1..3..3....1..3..3....2..0..1....1..2..1....0..0..0
%Y A266185 Cf. A266183.
%K A266185 nonn
%O A266185 1,1
%A A266185 _R. H. Hardin_, Dec 23 2015