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.

A229385 Number of n X n 0..3 arrays of the sum of the corresponding element, the element to the east and the element to the south in a larger (n+1)X(n+1) 0..1 array.

Original entry on oeis.org

4, 128, 19124, 10624396, 22494002188, 187243393024012, 6184286713271025676, 813778114811695225372684, 427490676925568251567286517772, 897390142311167244989919805371842572
Offset: 1

Views

Author

R. H. Hardin Sep 21 2013

Keywords

Comments

Diagonal of A229392

Examples

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