T(n,k) is the number of s in {1,...,n}^n having shortest run with the same value of length k; triangle T(n,k), n>=0, 0<=k<=n, read by rows.
A228617
T(n,k) is the number of s in {1,...,n}^n having shortest run with the same value of length k; triangle T(n,k), n>=0, 0<=k<=n, read by rows.
Terms
- a(0) =1a(1) =0a(2) =1a(3) =0a(4) =2a(5) =2a(6) =0a(7) =24a(8) =0a(9) =3a(10) =0a(11) =240a(12) =12a(13) =0a(14) =4a(15) =0a(16) =3080a(17) =40a(18) =0a(19) =0a(20) =5a(21) =0a(22) =46410a(23) =210a(24) =30a(25) =0a(26) =0a(27) =6a(28) =0a(29) =822612
External references
- oeis: A228617