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.

A266095 Number of n X n 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 A266095 #6 Apr 20 2020 19:41:39
%S A266095 1,5,64,929,53442,12401485,6206090116,5955851105844,17910530164706984,
%T A266095 181493083347714402782,4372527304675102033719740,
%U A266095 234910588564744761536499928490
%N A266095 Number of n X n integer arrays with each element equal to the number of horizontal and antidiagonal neighbors exactly one smaller than itself.
%C A266095 Diagonal of A266101.
%e A266095 Some solutions for n=4
%e A266095 ..0..0..2..1....1..0..1..1....0..1..2..0....0..0..2..1....0..2..1..2
%e A266095 ..1..1..0..1....1..2..0..1....2..1..0..0....1..1..0..1....1..0..1..1
%e A266095 ..2..1..2..0....0..2..1..1....1..0..2..1....1..0..1..1....1..2..0..0
%e A266095 ..1..0..0..1....1..0..0..1....1..1..0..0....1..2..0..0....0..0..0..1
%Y A266095 Cf. A266101.
%K A266095 nonn
%O A266095 1,2
%A A266095 _R. H. Hardin_, Dec 21 2015