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.

A264715 Number of 2Xn arrays of permutations of 0..n*2-1 with rows nondecreasing modulo 5 and columns nondecreasing modulo 6.

This page as a plain text file.
%I A264715 #3 Nov 21 2015 08:33:43
%S A264715 1,2,2,18,116,627,6211,59011,449824,5256100,90734544,1163859524,
%T A264715 24333174896,578216191424,11292787466976
%N A264715 Number of 2Xn arrays of permutations of 0..n*2-1 with rows nondecreasing modulo 5 and columns nondecreasing modulo 6.
%C A264715 Row 2 of A264714.
%e A264715 Some solutions for n=6
%e A264715 ..0.11..1..6..8..9...10..0..1..6..2..7....0..5..6..1..3..8....0.11..1..6..7..3
%e A264715 .10..5..7..2..3..4....5.11..3..8..4..9...10.11..7..2..9..4...10..5..2..8..4..9
%Y A264715 Cf. A264714.
%K A264715 nonn
%O A264715 1,2
%A A264715 _R. H. Hardin_, Nov 21 2015