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.

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

This page as a plain text file.
%I A264714 #3 Nov 21 2015 08:33:23
%S A264714 1,1,1,1,2,1,1,2,2,1,1,18,40,11,1,2,116,803,815,94,1,4,627,23775,
%T A264714 74070,22320,365,2,8,6211,468540,3908105,3432012,352181,2891,4,16,
%U A264714 59011,17266449,530614763
%N A264714 T(n,k)=Number of nXk arrays of permutations of 0..n*k-1 with rows nondecreasing modulo 5 and columns nondecreasing modulo 6.
%C A264714 Table starts
%C A264714 .1....1......1.......1.......1.........2........4.....8.16
%C A264714 .1....2......2......18.....116.......627.....6211.59011
%C A264714 .1....2.....40.....803...23775....468540.17266449
%C A264714 .1...11....815...74070.3908105.530614763
%C A264714 .1...94..22320.3432012
%C A264714 .1..365.352181
%C A264714 .2.2891
%e A264714 Some solutions for n=4 k=4
%e A264714 .15..0.13..8....0..6..8.13....0..1.13.14....0..1..7.13....0..6..7..2
%e A264714 .10.12..7..2....1.12..2..7...12..7..2..8...12..2..3.14....1.12..3..8
%e A264714 .11..6..1.14...10..3..4.14....6..3..9..4....6..8..9..4...13.14..9..4
%e A264714 ..5..3..4..9....5.15.11..9....5.15.10.11...15..5.10.11...15..5.10.11
%Y A264714 Column 1 is A264701.
%Y A264714 Row 1 is A264656.
%K A264714 nonn,tabl
%O A264714 1,5
%A A264714 _R. H. Hardin_, Nov 21 2015