login
T(n,k) = Number of nondecreasing arrangements of n+3 numbers in 0..k with each number being the sum mod (k+1) of three others.
8

%I #9 Oct 11 2023 15:53:37

%S 3,1,4,5,7,5,1,14,17,6,3,5,38,25,7,1,24,66,70,34,8,5,1,130,174,111,44,

%T 9,1,22,136,364,329,162,55,10,3,9,243,664,771,539,224,67,11,1,12,242,

%U 1160,1720,1386,815,298,80,12,5,3,385,1866,3347,3491,2281,1169,385,94,13,1,50

%N T(n,k) = Number of nondecreasing arrangements of n+3 numbers in 0..k with each number being the sum mod (k+1) of three others.

%H R. H. Hardin, <a href="/A183904/b183904.txt">Table of n, a(n) for n = 1..176</a>

%e Table starts:

%e ..3..1...5....1....3.....1.....5......1......3......1......5......1......3

%e ..4..7..14....5...24.....1....22......9.....12......3.....50......1......4

%e ..5.17..38...66..130...136...243....242....385....251....593....257....624

%e ..6.25..70..174..364...664..1160...1866...2768...3666...5646...6253...8846

%e ..7.34.111..329..771..1720..3347...6503..10734..17926..28720..42251..61524

%e ..8.44.162..539.1386..3491..7416..15973..29070..54543..93776.157192.247014

%e ..9.55.224..815.2281..6263.14376..33236..65672.132796.243172.442027

%e .10.67.298.1169.3534.10400.25584..62678.132778.284451.550980

%e .11.80.385.1614.5236.16357.42852.110487.248816.559841

%e .12.94.486.2164.7492.24694.68552.185231.440772

%e Some solutions for n=3 and k=2:

%e ..0....0....0....0....0....0....0....0....0....0....0....1....0....0....0....0

%e ..0....0....0....0....0....0....0....0....1....1....0....1....0....1....0....1

%e ..2....0....0....0....0....1....0....0....1....1....1....1....0....1....1....2

%e ..2....2....1....1....0....1....0....1....1....1....2....2....0....2....1....2

%e ..2....2....1....1....2....1....1....2....2....1....2....2....0....2....2....2

%e ..2....2....1....2....2....1....1....2....2....2....2....2....0....2....2....2

%K nonn,tabl

%O 1,1

%A _R. H. Hardin_, Jan 07 2011