A266573
Number of 3Xn arrays containing n copies of 0..3-1 with no element 1 greater than its northwest or southwest neighbor modulo 3 and the upper left element equal to 0.
Original entry on oeis.org
2, 5, 15, 109, 574, 2840, 13767, 71646, 390862, 2170370, 11989812, 66094738, 366119221, 2044786962, 11503587136, 65003352026, 368281990242, 2091514533360, 11909843102866, 68009104297282, 389348569168108, 2233795881384252
Offset: 1
Some solutions for n=6
..0..1..1..0..0..1....0..2..0..1..1..0....0..2..2..0..1..2....0..1..0..0..1..1
..2..2..0..1..2..0....2..0..1..2..0..1....2..0..1..2..0..1....2..0..0..2..2..0
..2..1..2..0..1..2....0..1..2..1..2..2....1..1..0..1..2..0....1..1..2..2..1..2
A266574
Number of 4Xn arrays containing n copies of 0..4-1 with no element 1 greater than its northwest or southwest neighbor modulo 4 and the upper left element equal to 0.
Original entry on oeis.org
6, 74, 2320, 77830, 2595190, 94930586, 3708826784, 148879349035, 6098536482216, 255081230000786, 10848711502940592, 467125765450160196, 20321101379722519804, 892020118445773622883, 39459836156094190716464
Offset: 1
Some solutions for n=4
..0..1..3..1....0..0..1..2....0..1..2..1....0..2..3..3....0..2..3..3
..1..3..3..1....2..2..0..3....3..0..3..2....0..3..0..1....2..0..1..1
..0..0..2..2....2..1..1..3....0..1..2..3....1..2..3..0....2..2..3..0
..2..2..3..0....3..1..0..3....3..0..1..2....2..1..1..2....0..1..1..3
A266570
Number of nX2 arrays containing 2 copies of 0..n-1 with no element 1 greater than its northwest or southwest neighbor modulo n and the upper left element equal to 0.
Original entry on oeis.org
1, 1, 5, 74, 2668, 150836, 12011058, 1279437414, 175836809388, 30308775142980, 6404886614932128
Offset: 1
Some solutions for n=6
..0..4....0..3....0..1....0..3....0..4....0..1....0..0....0..1....0..3....0..1
..2..2....1..4....5..2....0..5....2..5....5..0....4..5....5..3....0..4....5..3
..5..0....1..5....4..3....2..2....0..1....4..4....2..1....3..1....5..4....4..2
..3..3....2..4....5..4....4..5....3..4....5..3....3..4....4..0....2..1....5..3
..1..1....0..5....2..3....3..4....2..3....3..2....5..2....2..4....5..1....0..1
..5..4....2..3....0..1....1..1....5..1....2..1....3..1....2..5....3..2....2..4
A266571
Number of nX3 arrays containing 3 copies of 0..n-1 with no element 1 greater than its northwest or southwest neighbor modulo n and the upper left element equal to 0.
Original entry on oeis.org
1, 1, 15, 2320, 729874, 466056593, 515679132204, 897699718056452
Offset: 1
Some solutions for n=4
..0..2..1....0..3..1....0..2..2....0..0..3....0..2..1....0..2..3....0..2..3
..3..2..2....1..3..2....2..3..0....1..0..2....0..3..1....2..0..1....3..0..0
..0..3..1....0..0..1....1..1..1....1..3..2....3..2..1....2..1..3....1..1..2
..0..3..1....2..3..2....3..3..0....1..3..2....3..2..0....1..0..3....2..3..1
Showing 1-4 of 4 results.
Comments