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.

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

This page as a plain text file.
%I A264862 #3 Nov 26 2015 20:02:44
%S A264862 1,1,1,1,2,1,1,5,5,1,1,12,30,8,1,1,72,839,839,47,1,2,516,16365,39131,
%T A264862 15000,422,1,4,2727,550479,4497392,3474446,530302,1625,2,8,29935,
%U A264862 8299492,285666842
%N A264862 T(n,k)=Number of nXk arrays of permutations of 0..n*k-1 with rows nondecreasing modulo 6 and columns nondecreasing modulo 7.
%C A264862 Table starts
%C A264862 .1....1......1.......1.......1.........1.......2.....4.8
%C A264862 .1....2......5......12......72.......516....2727.29935
%C A264862 .1....5.....30.....839...16365....550479.8299492
%C A264862 .1....8....839...39131.4497392.285666842
%C A264862 .1...47..15000.3474446
%C A264862 .1..422.530302
%C A264862 .1.1625
%C A264862 .2
%e A264862 Some solutions for n=4 k=4
%e A264862 ..0..7..1.14....0..1..7..2....7.14..8.15....0..7.14.15....0.14..8.15
%e A264862 ..8..9..3.15...14..8.15.10...12..0..1..3....8..3..9.11...12..7..3..9
%e A264862 .12..2..4.10...13..9..3..4...13..2..9..4....1.13..2..4....6..1..4.10
%e A264862 ..6.13..5.11....6.12..5.11....6.10..5.11...12..6.10..5...13..2.11..5
%Y A264862 Column 1 is A264791.
%Y A264862 Row 1 is A264701.
%K A264862 nonn,tabl
%O A264862 1,5
%A A264862 _R. H. Hardin_, Nov 26 2015