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.

A266106 Number of 6Xn integer arrays with each element equal to the number of horizontal and antidiagonal neighbors exactly one smaller than itself.

This page as a plain text file.
%I A266106 #4 Dec 21 2015 08:24:21
%S A266106 1,272,3928,26948,457738,12401485,240721036,3915407831,72703138725,
%T A266106 1459414293797,27836081746405,518910020345998,9822723169066292,
%U A266106 186833710020397058,3546385987603510610,67356747007063872600
%N A266106 Number of 6Xn integer arrays with each element equal to the number of horizontal and antidiagonal neighbors exactly one smaller than itself.
%C A266106 Row 6 of A266101.
%H A266106 R. H. Hardin, <a href="/A266106/b266106.txt">Table of n, a(n) for n = 1..210</a>
%e A266106 Some solutions for n=4
%e A266106 ..0..0..1..2....0..2..1..2....1..0..2..1....1..0..2..1....1..0..0..1
%e A266106 ..0..2..1..1....1..0..1..1....1..1..0..1....1..1..0..0....0..2..1..1
%e A266106 ..0..0..0..0....0..2..0..1....2..1..2..0....2..1..2..0....1..0..0..0
%e A266106 ..0..0..0..0....1..0..2..1....1..0..0..1....2..1..0..0....0..0..2..1
%e A266106 ..1..2..0..0....0..0..0..1....0..0..1..1....2..1..2..1....1..1..0..1
%e A266106 ..1..0..0..1....1..1..1..0....1..1..0..0....1..0..0..0....2..1..2..0
%Y A266106 Cf. A266101.
%K A266106 nonn
%O A266106 1,2
%A A266106 _R. H. Hardin_, Dec 21 2015