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.

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

This page as a plain text file.
%I A264643 #3 Nov 19 2015 13:53:36
%S A264643 1,1,1,1,1,1,2,8,6,1,4,55,149,30,2,8,572,5080,3741,284,4,24,5928,
%T A264643 364544,1185056,199456,2344,8,72,113808,46305472,715001088,503460352,
%U A264643 18120064,31632,16,216,2536688,6958619648
%N A264643 T(n,k)=Number of nXk arrays of permutations of 0..n*k-1 with rows nondecreasing modulo 3 and columns nondecreasing modulo 4.
%C A264643 Table starts
%C A264643 ..1.....1........1.........2.........4........8.........24......72.216
%C A264643 ..1.....1........8........55.......572.....5928.....113808.2536688
%C A264643 ..1.....6......149......5080....364544.46305472.6958619648
%C A264643 ..1....30.....3741...1185056.715001088
%C A264643 ..2...284...199456.503460352
%C A264643 ..4..2344.18120064
%C A264643 ..8.31632
%C A264643 .16
%e A264643 Some solutions for n=3 k=4
%e A264643 ..9..0..8..5....2..5.11..8....0..1..4..8....0..6..8..5...10..1..4..8
%e A264643 ..1..4..7.10...10..1..7..4....9..3..5..2....9.10..4..1....6..9..3..0
%e A264643 ..3..6.11..2....6..9..3..0....6..7.10.11....3..7..2.11....7..2.11..5
%Y A264643 Column 1 is A264635.
%Y A264643 Row 1 is A264557.
%K A264643 nonn,tabl
%O A264643 1,7
%A A264643 _R. H. Hardin_, Nov 19 2015