Number A(n,k) of 3n-length k-ary words, either empty or beginning with the first letter of the alphabet, that can be built by repeatedly inserting triples of identical letters into the initially empty word; square array A(n,k), n>=0, k>=0, by antidiagonals.

A213027

Number A(n,k) of 3n-length k-ary words, either empty or beginning with the first letter of the alphabet, that can be built by repeatedly inserting triples of identical letters into the initially empty word; square array A(n,k), n>=0, k>=0, by antidiagonals.

Terms

    a(0) =1a(1) =1a(2) =0a(3) =1a(4) =1a(5) =0a(6) =1a(7) =1a(8) =1a(9) =0a(10) =1a(11) =1a(12) =4a(13) =1a(14) =0a(15) =1a(16) =1a(17) =7a(18) =19a(19) =1a(20) =0a(21) =1a(22) =1a(23) =10a(24) =61a(25) =98a(26) =1a(27) =0a(28) =1a(29) =1

External references