login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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
7
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,2
COMMENTS
Table starts
.1.........2..............3.................4....................5
.1.........8.............27................64..................125
.4........72............776..............4160................15804
.2......1020..........59052...........1048560..............9765630
.1.....32768.......14348907........1073741824..........30517578125
.1...2097152....10460353203.....4398046511104......476837158203125
.1.268460064.22876792454961.72057594037927936.37252902986083985625
LINKS
EXAMPLE
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
CROSSREFS
Column 1 is A144260(n+1)
Sequence in context: A265891 A248354 A260142 * A137307 A256420 A205391
KEYWORD
nonn,tabl
AUTHOR
R. H. Hardin Aug 27 2011
STATUS
approved