A194505 T(n,k)=Number of lower triangles of an n X n 0..k array with each element unequal to the sum mod k+1 of its horizontal and vertical neighbors.
1, 2, 1, 3, 8, 4, 4, 27, 72, 2, 5, 64, 776, 1020, 1, 6, 125, 4160, 59052, 32768, 1, 7, 216, 15804, 1048560, 14348907, 2097152, 1, 8, 343, 46872, 9765630, 1073741824, 10460353203, 268460064, 16, 9, 512, 118096, 60466140, 30517578125
Offset: 1
Examples
Some solutions for n=4 k=3 ..3........0........1........1........1........2........2........0 ..2.1......1.1......3.2......3.3......3.2......3.0......3.0......1.2 ..1.2.1....2.3.2....1.1.2....2.3.1....2.1.1....2.3.1....3.0.1....0.3.1 ..2.0.1.3..0.0.0.3..0.1.3.1..1.2.1.0..0.3.3.0..3.3.0.1..1.3.0.3..2.3.3.1
Links
- R. H. Hardin, Table of n, a(n) for n = 1..62
Crossrefs
Column 1 is A144260(n+1)
Comments