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.

A268161 Number of 4Xn arrays containing n copies of 0..4-1 with every element equal to at least one vertical or antidiagonal neighbor and the top left element equal to 0.

This page as a plain text file.
%I A268161 #6 Aug 12 2016 06:54:17
%S A268161 0,6,36,906,31818,770406,28194516,857204082,29334686760,981701367120,
%T A268161 33610273278060,1163386717573176,40538287466544630,
%U A268161 1426710530475496692,50491865673413814126,1798794705043994212440,64408154737694955274872
%N A268161 Number of 4Xn arrays containing n copies of 0..4-1 with every element equal to at least one vertical or antidiagonal neighbor and the top left element equal to 0.
%C A268161 Row 4 of A268159.
%H A268161 R. H. Hardin, <a href="/A268161/b268161.txt">Table of n, a(n) for n = 1..20</a>
%e A268161 Some solutions for n=4
%e A268161 ..0..1..0..2....0..1..0..3....0..2..3..1....0..0..1..3....0..3..2..0
%e A268161 ..0..1..0..2....0..1..0..3....0..2..3..1....0..0..1..3....0..3..2..0
%e A268161 ..1..3..3..2....1..3..2..2....3..1..2..0....2..2..3..1....2..3..1..1
%e A268161 ..1..3..3..2....1..3..2..2....3..1..2..0....2..2..3..1....2..3..1..1
%Y A268161 Cf. A268159.
%K A268161 nonn
%O A268161 1,2
%A A268161 _R. H. Hardin_, Jan 27 2016