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.

A264795 Number of 2Xn arrays of permutations of 0..n*2-1 with rows nondecreasing modulo 2 and columns nondecreasing modulo 7.

This page as a plain text file.
%I A264795 #5 Nov 25 2015 07:49:11
%S A264795 1,3,15,130,1944,40188,1149120,49148112,2541311040,156667403520,
%T A264795 11530576378368
%N A264795 Number of 2Xn arrays of permutations of 0..n*2-1 with rows nondecreasing modulo 2 and columns nondecreasing modulo 7.
%C A264795 Row 2 of A264794.
%e A264795 Some solutions for n=6
%e A264795 ..8..2..0..4..9..7...10..0..2..8..4..1....2..4..0..1..3..7....8..0..1..7..3..9
%e A264795 ..6.10..3..5.11..1....6..7..9..3.11..5...10..6..8..9..5.11....4..6.10..2..5.11
%Y A264795 Cf. A264794.
%K A264795 nonn
%O A264795 1,2
%A A264795 _R. H. Hardin_, Nov 25 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.