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.

A229438 Number of n X n 0..2 arrays with horizontal differences mod 3 never 1, vertical differences mod 3 never -1, and rows and columns lexicographically nondecreasing.

Original entry on oeis.org

3, 7, 22, 109, 753, 6374, 62205, 676983, 8026548, 101907085, 1368004992, 19233435438, 281169127711, 4249797119751, 66116288446463
Offset: 1

Views

Author

R. H. Hardin Sep 23 2013

Keywords

Comments

Diagonal of A229445

Examples

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