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.

This page as a plain text file.
%I A280670 #4 Jan 07 2017 08:05:00
%S A280670 30,1917,119440,7533245,474736149,29920114246,1885698283255,
%T A280670 118845116023725,7490149091439288,472062591963218273,
%U A280670 29751489321018113345,1875071509361980884750,118175366862571989996619
%N 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.
%C A280670 Column 5 of A280673.
%H A280670 R. H. Hardin, <a href="/A280670/b280670.txt">Table of n, a(n) for n = 1..210</a>
%F A280670 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
%e A280670 Some solutions for n=3
%e A280670 ..0..1..2..1..2. .0..1..2..1..1. .0..0..1..2..0. .0..1..2..0..2
%e A280670 ..0..0..2..0..2. .2..1..0..0..2. .2..2..0..2..2. .0..1..0..1..1
%e A280670 ..2..0..2..0..0. .1..2..2..1..0. .0..2..0..0..1. .1..2..0..0..2
%Y A280670 Cf. A280673.
%K A280670 nonn
%O A280670 1,1
%A A280670 _R. H. Hardin_, Jan 07 2017