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.

A264939 Number of n X n arrays containing n 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 A264939 #7 Aug 12 2016 06:53:58
%S A264939 1,2,56,184740,137409486772,36724170744914466520,
%T A264939 5395269899168064415277849230476
%N A264939 Number of n X n arrays containing n copies of 0..n-1 with no equal horizontal neighbors and new values introduced sequentially from 0.
%C A264939 Diagonal of A264945.
%e A264939 Some solutions for n=4
%e A264939 ..0..1..2..0....0..1..2..0....0..1..0..1....0..1..2..0....0..1..0..2
%e A264939 ..3..2..0..3....0..2..3..1....2..1..3..0....3..2..1..2....2..1..2..3
%e A264939 ..3..2..1..3....1..2..1..3....2..3..2..3....0..3..0..1....0..1..0..3
%e A264939 ..0..1..2..1....2..3..0..3....2..3..0..1....3..1..3..2....2..3..1..3
%Y A264939 Cf. A264945.
%K A264939 nonn
%O A264939 1,2
%A A264939 _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.