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.

A280670 Number of nX5 0..2 arrays with no element equal to more than one of its horizontal and antidiagonal neighbors and with new values introduced in order 0 sequentially upwards.

Original entry on oeis.org

30, 1917, 119440, 7533245, 474736149, 29920114246, 1885698283255, 118845116023725, 7490149091439288, 472062591963218273, 29751489321018113345, 1875071509361980884750, 118175366862571989996619
Offset: 1

Views

Author

R. H. Hardin, Jan 07 2017

Keywords

Comments

Column 5 of A280673.

Examples

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

Crossrefs

Cf. A280673.

Formula

Empirical: a(n) = 59*a(n-1) +268*a(n-2) -869*a(n-3) -2331*a(n-4) +3754*a(n-5) -8240*a(n-6) -88*a(n-7) -3472*a(n-8) for n>9