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.

A266099 Number of nX6 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 A266099 #6 Dec 21 2015 08:19:01
%S A266099 16,233,3846,52171,841668,12401485,192212829,2895851074,44366390231,
%T A266099 672954998752,10269568494478,156143709545549,2379379735679900,
%U A266099 36209116313028044,551475236102985343,8394994559793315602
%N A266099 Number of nX6 integer arrays with each element equal to the number of horizontal and antidiagonal neighbors exactly one smaller than itself.
%C A266099 Column 6 of A266101.
%H A266099 R. H. Hardin, <a href="/A266099/b266099.txt">Table of n, a(n) for n = 1..210</a>
%H A266099 R. H. Hardin, <a href="/A266099/a266099.txt">Empirical recurrence of order 72</a>
%F A266099 Empirical recurrence of order 72 (see link above)
%e A266099 Some solutions for n=4
%e A266099 ..0..2..1..2..0..0....1..0..0..1..1..0....1..0..0..0..1..2....1..0..2..1..0..1
%e A266099 ..1..0..1..2..0..0....1..2..2..1..0..0....1..1..1..1..1..0....1..1..1..2..1..0
%e A266099 ..0..1..1..1..2..0....1..0..2..0..0..1....2..1..0..1..2..1....0..0..0..2..0..1
%e A266099 ..1..0..2..1..0..0....0..1..2..1..1..0....2..1..1..0..0..1....0..0..1..1..1..0
%Y A266099 Cf. A266101.
%K A266099 nonn
%O A266099 1,1
%A A266099 _R. H. Hardin_, Dec 21 2015