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.

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

This page as a plain text file.
%I A264709 #3 Nov 21 2015 08:20:17
%S A264709 1,1,1,1,1,1,2,8,4,1,4,84,152,28,1,8,800,8064,4544,176,1,24,15360,
%T A264709 789696,1555200,202176,1600,2,72,357696,120512448,2248445952,
%U A264709 963726336,10964160,16128,4,216,6873984,29928517632,3889709973504
%N A264709 T(n,k)=Number of nXk arrays of permutations of 0..n*k-1 with rows nondecreasing modulo 3 and columns nondecreasing modulo 6.
%C A264709 Table starts
%C A264709 .1.....1........1.........2..........4.............8..........24......72.216
%C A264709 .1.....1........8........84........800.........15360......357696.6873984
%C A264709 .1.....4......152......8064.....789696.....120512448.29928517632
%C A264709 .1....28.....4544...1555200.2248445952.3889709973504
%C A264709 .1...176...202176.963726336
%C A264709 .1..1600.10964160
%C A264709 .2.16128
%e A264709 Some solutions for n=3 k=4
%e A264709 ..6..1..7..8....0..1..7.10....3..6..0..9....0..6..7..1....0..9..4..1
%e A264709 ..0..3..2.11....6..8..2.11...10..1..7..4....3..9..2..8....6..3.10..7
%e A264709 ..9..4.10..5....9..3..4..5....5..2..8.11....4.10..5.11....8..5.11..2
%Y A264709 Column 1 is A264701.
%Y A264709 Row 1 is A264557.
%K A264709 nonn,tabl
%O A264709 1,7
%A A264709 _R. H. Hardin_, Nov 21 2015