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.

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

Original entry on oeis.org

1, 39, 230, 929, 6307, 52171, 371130, 2568565, 18322421, 129531126, 926299920, 6712699992, 48087248218, 341400959047, 2440466698929, 17538694281014, 125725413376414, 899035671334963, 6432936252126858, 46077832832481217
Offset: 1

Views

Author

R. H. Hardin, Dec 21 2015

Keywords

Comments

Row 4 of A266101.

Examples

			Some solutions for n=4
..1..0..0..0....1..0..1..1....0..1..2..0....1..0..1..1....0..0..1..1
..0..0..0..0....1..1..0..1....2..1..1..2....0..2..0..1....1..1..0..0
..0..0..0..0....2..1..2..0....0..2..1..1....1..0..2..1....1..0..0..1
..0..0..0..1....1..0..0..0....0..0..0..1....0..0..0..0....1..2..1..0
		

Crossrefs

Cf. A266101.