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.

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

This page as a plain text file.
%I A280361 #4 Jan 01 2017 08:57:06
%S A280361 82,9188,924579,97147710,10144351660,1061399606602,111020011111453,
%T A280361 11613529410292966,1214844953592240427,127080650055334484381,
%U A280361 13293449766186695244141,1390580270989675054905421
%N A280361 Number of nX6 0..2 arrays with no element equal to more than one of its horizontal and vertical neighbors and with new values introduced in order 0 sequentially upwards.
%C A280361 Column 6 of A280362.
%H A280361 R. H. Hardin, <a href="/A280361/b280361.txt">Table of n, a(n) for n = 1..210</a>
%e A280361 Some solutions for n=2
%e A280361 ..0..1..0..1..1..0. .0..1..2..0..1..0. .0..0..1..2..1..0. .0..1..2..0..1..1
%e A280361 ..1..0..1..0..0..1. .2..0..2..0..2..1. .1..2..1..0..1..0. .2..1..0..2..0..0
%Y A280361 Cf. A280362.
%K A280361 nonn
%O A280361 1,1
%A A280361 _R. H. Hardin_, Jan 01 2017