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.

A267625 Number of nX2 arrays containing 2 copies of 0..n-1 with every element equal to or 1 greater than any west neighbor modulo n and the upper left element equal to 0.

This page as a plain text file.
%I A267625 #4 Aug 12 2016 07:04:22
%S A267625 1,3,7,27,138,900,7110,66150,708120,8573040,115781400,1725154200,
%T A267625 28103922000,496799503200,9469060801200,193546022670000
%N A267625 Number of nX2 arrays containing 2 copies of 0..n-1 with every element equal to or 1 greater than any west neighbor modulo n and the upper left element equal to 0.
%C A267625 Column 2 of A267629.
%e A267625 Some solutions for n=4
%e A267625 ..0..1....0..0....0..1....0..0....0..0....0..1....0..1....0..0....0..1....0..1
%e A267625 ..3..3....3..3....2..3....1..1....3..3....2..3....2..3....1..1....3..0....3..3
%e A267625 ..0..1....1..2....1..2....2..3....1..1....2..3....0..1....3..3....1..2....2..2
%e A267625 ..2..2....1..2....3..0....2..3....2..2....0..1....2..3....2..2....2..3....0..1
%Y A267625 Cf. A267629.
%K A267625 nonn
%O A267625 1,2
%A A267625 _R. H. Hardin_, Jan 18 2016

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

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