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.

A265371 Number of nX3 arrays containing 3 copies of 0..n-1 with no equal horizontal, vertical or antidiagonal neighbors and new values introduced sequentially from 0.

This page as a plain text file.
%I A265371 #5 Aug 12 2016 07:05:16
%S A265371 0,0,1,32,4954,878953,192333677,53404173562,18545695848787,
%T A265371 7914432322153846
%N A265371 Number of nX3 arrays containing 3 copies of 0..n-1 with no equal horizontal, vertical or antidiagonal neighbors and new values introduced sequentially from 0.
%C A265371 Column 3 of A265373.
%e A265371 Some solutions for n=4
%e A265371 ..0..1..0....0..1..2....0..1..2....0..1..2....0..1..2....0..1..2....0..1..2
%e A265371 ..2..3..2....3..0..3....2..0..3....3..0..1....3..0..1....2..3..0....2..3..0
%e A265371 ..1..0..3....1..2..1....1..2..0....1..3..2....2..3..0....1..2..3....1..2..1
%e A265371 ..3..1..2....0..3..2....3..1..3....2..0..3....1..2..3....3..1..0....3..0..3
%Y A265371 Cf. A265373.
%K A265371 nonn
%O A265371 1,4
%A A265371 _R. H. Hardin_, Dec 07 2015