A183892 T(n,k)=Number of arrangements of n+3 numbers in 0..k with each number being the sum mod (k+1) of three others.
8, 1, 22, 16, 121, 52, 1, 292, 631, 114, 8, 241, 2574, 2059, 240, 1, 982, 8681, 13344, 6399, 494, 16, 1, 20152, 63645, 59518, 19483, 1004, 1, 492, 32821, 201154, 363749, 250124, 58807, 2026, 8, 241, 57614, 542557, 1466628, 1905097, 1024174, 176859
Offset: 1
Examples
Some solutions for n=3 ..1....2....2....1....2....1....1....0....0....2....1....2....0....0....1....1 ..2....0....1....1....2....2....0....2....1....2....2....0....2....0....0....2 ..2....0....2....0....0....1....0....0....1....0....0....1....2....1....2....2 ..2....2....0....1....1....1....2....1....1....2....1....2....0....1....2....1 ..0....2....1....2....2....0....1....2....1....0....1....1....2....2....2....1 ..0....2....1....1....2....2....0....0....0....2....0....2....0....1....1....2
Links
- R. H. Hardin, Table of n, a(n) for n = 1..176
Crossrefs
Column 1 is A005803(n+3)
Comments