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.

A264943 Number of nX5 arrays of permutations of 5 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 A264943 #3 Nov 29 2015 06:03:33
%S A264943 0,1,2350,11375145,137409486772,3537141103745065,
%T A264943 173357342638694530002,14844736259829478729001905
%N A264943 Number of nX5 arrays of permutations of 5 copies of 0..n-1 with no equal horizontal neighbors and new values introduced sequentially from 0.
%C A264943 Column 5 of A264945.
%e A264943 Some solutions for n=3
%e A264943 ..0..1..2..0..1....0..1..2..1..2....0..1..2..1..2....0..1..0..2..1
%e A264943 ..0..2..0..1..2....1..2..1..0..2....2..0..2..0..1....1..2..0..1..0
%e A264943 ..1..2..1..0..2....0..2..0..1..0....1..0..2..0..1....2..0..2..1..2
%Y A264943 Cf. A264945.
%K A264943 nonn
%O A264943 1,3
%A A264943 _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.