A183884 T(n,k)=Number of arrangements of n+2 numbers in 0..k with each number being the sum mod (k+1) of two others.

4, 1, 11, 4, 31, 26, 1, 35, 171, 57, 4, 25, 446, 631, 120, 1, 89, 821, 2827, 2059, 247, 4, 1, 1566, 8361, 13686, 6399, 502, 1, 35, 1231, 20527, 57625, 59859, 19483, 1013, 4, 31, 1986, 32521, 183310, 336617, 250198, 58807, 2036, 1, 35, 1761, 52827, 424537

Offset: 1

Author

R. H. Hardin Jan 07 2011

Keywords

• nonn
• tabl

Comments

Table starts

....4......1........4.........1..........4...........1...........4............1

...11.....31.......35........25.........89...........1..........35...........31

...26....171......446.......821.......1566........1231........1986.........1761

...57....631.....2827......8361......20527.......32521.......52827........75451

..120...2059....13686.....57625.....183310......424537......885690......1598395

..247...6399....59859....336617....1347565.....4079713....10540371.....23327655

..502..19483...250198...1817149....8984158....33702403...104446714....275846173

.1013..58807..1023347...9433849...56952323...257404033...938543435...2895194179

.2036.176859..4140830..48036737..351661806..1885866973..7996169226..28388585391

.4083.531103.16663627.242284857.2141759809.13515603289.66170227587.267809160367

Examples

			Some solutions for n=3
..1....1....1....2....0....1....1....0....1....1....1....2....0....0....0....0
..0....0....2....2....1....0....1....1....2....2....2....2....0....2....1....2
..1....2....1....1....2....2....2....1....0....2....1....1....0....2....2....0
..2....1....1....2....2....2....2....2....0....1....2....0....1....0....0....1
..0....0....2....0....2....2....0....0....2....2....2....2....1....1....2....1
		

Links

• R. H. Hardin, Table of n, a(n) for n = 1..216

Crossrefs

Column 1 is A000295(n+2)