|
|
A267836
|
|
T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with every element equal to or 1 greater than any northeast neighbor modulo n and the upper left element equal to 0.
|
|
8
|
|
|
1, 1, 1, 1, 3, 2, 1, 10, 11, 6, 1, 35, 91, 54, 24, 1, 126, 829, 924, 330, 120, 1, 462, 8013, 19696, 10924, 2430, 720, 1, 1716, 80497, 456052, 499523, 147340, 20970, 5040, 1, 6435, 830673, 11169884, 26266875, 13895954, 2247540, 207900, 40320, 1, 24310
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,5
|
|
COMMENTS
|
Table starts
......1........1.........1...........1............1............1..............1
......1........3........10..........35..........126..........462...........1716
......2.......11........91.........829.........8013........80497.........830673
......6.......54.......924.......19696.......456052.....11169884......284749896
.....24......330.....10924......499523.....26266875...1478892354....87594047188
....120.....2430....147340....13895954...1578668020.197549600170.26227806728176
....720....20970...2247540...422626232.100947966762
...5040...207900..38338680.14039428460
..40320..2331000.723997540
.362880.29189160
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=4 k=4
..0..1..1..2....0..1..2..3....0..1..3..0....0..3..0..0....0..1..0..2
..2..1..3..0....1..2..0..3....1..0..1..1....0..1..1..3....1..1..3..2
..2..3..1..3....3..1..0..2....0..2..2..3....1..2..3..2....2..3..3..0
..3..2..0..0....2..0..3..1....2..3..3..2....2..3..2..1....3..0..1..2
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|