T(n,k) is the number of s in {1,...,n}^n having longest ending contiguous subsequence with the same value of length k; triangle T(n,k), n>=0, 0<=k<=n, read by rows.
A228273
T(n,k) is the number of s in {1,...,n}^n having longest ending contiguous subsequence 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) =18a(8) =6a(9) =3a(10) =0a(11) =192a(12) =48a(13) =12a(14) =4a(15) =0a(16) =2500a(17) =500a(18) =100a(19) =20a(20) =5a(21) =0a(22) =38880a(23) =6480a(24) =1080a(25) =180a(26) =30a(27) =6a(28) =0a(29) =705894
External references
- oeis: A228273