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.

A266134 Number of 4Xn integer arrays with each element equal to the number of horizontal, diagonal and antidiagonal neighbors exactly one smaller than itself.

This page as a plain text file.
%I A266134 #4 Dec 21 2015 12:31:35
%S A266134 1,61,385,572,3851,44623,347576,1650710,12360130,106235031,807578953,
%T A266134 5406175833,41246496374,328408364493,2509089355110,18435763834038,
%U A266134 141054581587168,1100340622468942,8442342552511565,63751061176641632
%N A266134 Number of 4Xn integer arrays with each element equal to the number of horizontal, diagonal and antidiagonal neighbors exactly one smaller than itself.
%C A266134 Row 4 of A266131.
%H A266134 R. H. Hardin, <a href="/A266134/b266134.txt">Table of n, a(n) for n = 1..210</a>
%e A266134 Some solutions for n=4
%e A266134 ..0..1..1..0....0..0..0..0....1..0..1..2....1..2..0..1....2..1..1..0
%e A266134 ..2..3..2..2....1..2..2..0....1..1..1..2....1..0..2..0....0..1..1..2
%e A266134 ..2..1..1..0....1..1..0..1....1..1..0..1....2..1..0..0....1..2..2..1
%e A266134 ..2..1..0..1....1..0..2..0....1..0..2..0....2..1..2..0....0..0..0..0
%Y A266134 Cf. A266131.
%K A266134 nonn
%O A266134 1,2
%A A266134 _R. H. Hardin_, Dec 21 2015