A222878
T(n,k)=Number of nXk 0..3 arrays with no more than floor(nXk/2) elements equal to at least one horizontal or antidiagonal neighbor, with new values introduced in row major 0..3 order.
Original entry on oeis.org
1, 1, 2, 2, 11, 5, 11, 122, 131, 15, 34, 1814, 6282, 2150, 51, 131, 26311, 409775, 443510, 32491, 187, 438, 399849, 19707855, 95867967, 23794078, 533186, 715, 2150, 6013669, 1340197778, 20978414941, 22794825314, 1698174722, 8362152, 2795, 7676
Offset: 1
Some solutions for n=3 k=4
..0..0..0..1....0..0..1..0....0..0..1..2....0..1..0..1....0..1..0..2
..2..3..1..2....0..2..2..3....1..3..1..0....0..2..2..2....1..0..1..3
..0..2..3..0....0..3..2..1....1..2..0..2....1..0..0..0....2..0..2..1
A223041
T(n,k)=Number of nXk 0..3 arrays with no more than floor(nXk/2) elements equal to at least one horizontal, diagonal or antidiagonal neighbor, with new values introduced in row major 0..3 order.
Original entry on oeis.org
1, 1, 2, 2, 8, 5, 11, 98, 105, 15, 34, 1265, 3780, 1585, 51, 131, 17356, 229437, 255943, 23107, 187, 438, 241583, 8580619, 42964721, 10904199, 353631, 715, 2150, 3395532, 545607733, 7361951209, 8206670940, 751990800, 5338646, 2795, 7676, 48048796
Offset: 1
Some solutions for n=3 k=4
..0..1..0..2....0..1..2..3....0..1..0..0....0..1..2..0....0..1..2..2
..3..1..3..2....0..1..1..2....2..1..3..2....3..0..2..3....0..1..2..3
..2..2..1..1....2..3..0..3....3..2..0..2....2..0..1..2....3..1..2..3
A222828
T(n,k)=Number of nXk 0..3 arrays with no more than floor(nXk/2) elements equal to at least one horizontal, vertical or antidiagonal neighbor, with new values introduced in row major 0..3 order.
Original entry on oeis.org
1, 1, 1, 2, 8, 2, 11, 80, 80, 11, 34, 1154, 2695, 1154, 34, 131, 14388, 163059, 163059, 14388, 131, 438, 200082, 4990235, 23664739, 4990235, 200082, 438, 2150, 2652496, 324288311, 3489313607, 3489313607, 324288311, 2652496, 2150, 7676, 36622104
Offset: 1
Some solutions for n=3 k=4
..0..1..0..2....0..1..2..1....0..1..1..2....0..0..1..0....0..0..1..0
..2..0..3..3....2..0..0..2....0..2..3..1....2..0..0..1....1..0..2..3
..2..1..0..2....1..2..2..1....3..0..1..2....1..2..0..2....1..0..1..0
A222842
T(n,k) is the number of n X k 0..3 arrays with no more than floor(n*k/2) elements equal to at least one horizontal or vertical neighbor, with new values introduced in row major 0..3 order.
Original entry on oeis.org
1, 1, 1, 2, 8, 2, 11, 105, 105, 11, 34, 1585, 4797, 1585, 34, 131, 23107, 326408, 326408, 23107, 131, 438, 353631, 15364848, 70144361, 15364848, 353631, 438, 2150, 5338646, 1077545438, 15371324917, 15371324917, 1077545438, 5338646, 2150, 7676
Offset: 1
Some solutions for n=3 and k=4:
..0..1..0..2....0..1..0..1....0..1..0..2....0..1..0..0....0..1..1..2
..3..0..3..2....1..2..1..0....0..0..2..2....2..2..0..1....1..0..2..3
..2..1..3..0....0..1..2..2....2..1..0..3....3..0..1..0....0..1..2..3
Showing 1-4 of 4 results.
Comments