Regular triangle read by rows: T(n,k) is the number of (n,k)-Duck words, for n>=1 and 0<=k<=n-1.
A338403
Regular triangle read by rows: T(n,k) is the number of (n,k)-Duck words, for n>=1 and 0<=k<=n-1.
Terms
- a(0) =1a(1) =2a(2) =3a(3) =5a(4) =23a(5) =14a(6) =14a(7) =131a(8) =233a(9) =84a(10) =42a(11) =664a(12) =2339a(13) =2367a(14) =594a(15) =132a(16) =3166a(17) =18520a(18) =36265a(19) =24714a(20) =4719a(21) =429a(22) =14545a(23) =127511a(24) =408311a(25) =527757a(26) =266219a(27) =40898
External references
- oeis: A338403