|
|
A189650
|
|
T(n,k) = Number of n X k array permutations with each element moving zero or one space horizontally, diagonally or antidiagonally.
|
|
15
|
|
|
1, 2, 1, 3, 9, 1, 5, 33, 32, 1, 8, 185, 263, 121, 1, 13, 913, 4277, 2161, 450, 1, 21, 4777, 55440, 107080, 17655, 1681, 1, 34, 24577, 799069, 3774889, 2631821, 144353, 6272, 1, 55, 127385, 11047585, 157346785, 250758892, 64890337, 1180167, 23409, 1, 89
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
Table starts
.1......2.........3..............5..................8.....................13
.1......9........33............185................913...................4777
.1.....32.......263...........4277..............55440.................799069
.1....121......2161.........107080............3774889..............157346785
.1....450.....17655........2631821..........250758892............30010432933
.1...1681....144353.......64890337........16718653553..........5760755884032
.1...6272...1180167.....1598901325......1113666564608.......1104421532180261
.1..23409...9648721....39401919001.....74192202677913.....211788908613601649
.1..87362..78885143...970964720320...4942510226322656...40611524427488470629
.1.326041.644942273.23927183356745.329259659094878233.7787535228500656118433
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for 5X3
..0..2..1....0..1..2....1..0..4....0..3..2....0..1..2....4..0..2....0..5..2
..3..4..5....4..3..5....3..2..5....1..5..4....3..4..5....1..6..5....1..3..4
..6.11..8....6..8..7....6..8..7....7..6..8....7..6..8....7..3..8....6..9..8
..7..9.10....9.14.13....9.12.11....9.10.11...10.14.11....9.14.13....7.10.13
.12.14.13...12.11.10...10.14.13...12.14.13...12..9.13...12.11.10...12.11.14
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|