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.

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

This page as a plain text file.
%I A264941 #4 Aug 12 2016 07:05:15
%S A264941 0,1,56,3201,307016,43200625,8403205056,2162875665601,712215325718576,
%T A264941 292162814336854881,146127700393451369000
%N A264941 Number of nX3 arrays containing 3 copies of 0..n-1 with no equal horizontal neighbors and new values introduced sequentially from 0.
%C A264941 Column 3 of A264945.
%e A264941 Some solutions for n=4
%e A264941 ..0..1..2....0..1..2....0..1..2....0..1..2....0..1..2....0..1..2....0..1..2
%e A264941 ..3..0..2....3..0..2....3..2..0....3..0..1....0..1..3....3..1..3....1..2..3
%e A264941 ..3..1..3....3..1..3....0..1..3....2..3..0....1..2..3....2..3..0....2..1..3
%e A264941 ..1..0..2....0..2..1....1..3..2....1..3..2....2..3..0....2..1..0....0..3..0
%Y A264941 Cf. A264945.
%K A264941 nonn
%O A264941 1,3
%A A264941 _R. H. Hardin_, Nov 29 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.