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.

A264704 T(n,k)=Number of nXk arrays of permutations of 0..n*k-1 with rows nondecreasing modulo 2 and columns nondecreasing modulo 6.

This page as a plain text file.
%I A264704 #3 Nov 21 2015 08:06:44
%S A264704 1,1,1,2,3,1,4,15,6,1,12,212,296,36,1,36,3712,26304,9024,288,1,144,
%T A264704 96256,4689792,7708608,492480,2240,2,576,3423168,1263257856,
%U A264704 15216574464,4137827328,30233088,20736,4,2880,158521536,603321053184
%N A264704 T(n,k)=Number of nXk arrays of permutations of 0..n*k-1 with rows nondecreasing modulo 2 and columns nondecreasing modulo 6.
%C A264704 Table starts
%C A264704 .1.....1........2..........4..........12.........36..........144.......576.2880
%C A264704 .1.....3.......15........212........3712......96256......3423168.158521536
%C A264704 .1.....6......296......26304.....4689792.1263257856.603321053184
%C A264704 .1....36.....9024....7708608.15216574464
%C A264704 .1...288...492480.4137827328
%C A264704 .1..2240.30233088
%C A264704 .2.20736
%e A264704 Some solutions for n=3 k=4
%e A264704 ..0..6..8..7....4..6..0..7....8..6..2..0....4..2..6..7....0..6..3..1
%e A264704 ..2..4.10..1...10..2..8..1...10..1..5..3...10..8..0..1....8..2.10..7
%e A264704 ..9..5.11..3....5.11..3..9....4..7.11..9...11..3..9..5....4..5.11..9
%Y A264704 Row 1 is A111942(n+1).
%K A264704 nonn,tabl
%O A264704 1,4
%A A264704 _R. H. Hardin_, Nov 21 2015