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.

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

This page as a plain text file.
%I A264698 #3 Nov 21 2015 07:48:34
%S A264698 1,1,1,1,2,1,1,5,3,1,2,28,68,22,1,4,159,1541,1378,93,2,8,1383,37595,
%T A264698 102573,26662,790,4,16,16818,1947196,20144706,15357579,975419,7202,8,
%U A264698 48,168974,148906136
%N A264698 T(n,k)=Number of nXk arrays of permutations of 0..n*k-1 with rows nondecreasing modulo 4 and columns nondecreasing modulo 5.
%C A264698 Table starts
%C A264698 .1....1......1........1........2.......4.........8.....16.48
%C A264698 .1....2......5.......28......159....1383.....16818.168974
%C A264698 .1....3.....68.....1541....37595.1947196.148906136
%C A264698 .1...22...1378...102573.20144706
%C A264698 .1...93..26662.15357579
%C A264698 .2..790.975419
%C A264698 .4.7202
%e A264698 Some solutions for n=4 k=4
%e A264698 .10.15.11..7....5..6.10.15....1.10..2..6....1..5.10..6....0..5.15.11
%e A264698 ..5.13..1..2....0.13.11..7....3.15..7.11...13.15..7.11...12..6.10..2
%e A264698 ..0..9..6..3...12..9..1..3....8..0.12.14....4..0..8.12....4..8..1.13
%e A264698 .12..4..8.14....8..4..2.14....4..5.13..9....9..2.14..3....9.14..7..3
%Y A264698 Column 1 is A264656.
%Y A264698 Row 1 is A264635.
%K A264698 nonn,tabl
%O A264698 1,5
%A A264698 _R. H. Hardin_, Nov 21 2015