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.

A265230 Number of nX3 arrays containing 3 copies of 0..n-1 with no equal vertical neighbors and new values introduced sequentially from 0.

This page as a plain text file.
%I A265230 #4 Aug 12 2016 07:05:16
%S A265230 1,4,56,2592,222850,29357385,5460708807,1360701035812,437196618018421,
%T A265230 175924945354032520
%N A265230 Number of nX3 arrays containing 3 copies of 0..n-1 with no equal vertical neighbors and new values introduced sequentially from 0.
%C A265230 Column 3 of A265232.
%e A265230 Some solutions for n=4
%e A265230 ..0..0..1....0..0..1....0..0..1....0..1..2....0..1..2....0..0..1....0..1..1
%e A265230 ..2..1..3....2..3..2....1..2..3....3..0..1....3..0..0....2..2..0....2..3..0
%e A265230 ..3..3..2....1..2..1....3..0..2....1..3..3....2..2..1....1..3..3....1..0..3
%e A265230 ..1..2..0....3..0..3....2..3..1....2..2..0....3..1..3....3..2..1....3..2..2
%Y A265230 Cf. A265232.
%K A265230 nonn
%O A265230 1,2
%A A265230 _R. H. Hardin_, Dec 06 2015

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.