A(0,k) = 1: the empty word.
A(n,1) = 1: (aaa)^n.
A(2,2) = 4: there are 4 words of length 6 over alphabet {a,b}, 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: aaaaaa, aaabbb, aabbba, abbbaa.
A(2,3) = 7: aaaaaa, aaabbb, aaaccc, aabbba, aaccca, abbbaa, acccaa.
A(3,2) = 19: aaaaaaaaa, aaaaaabbb, aaaaabbba, aaaabbbaa, aaabaaabb, aaabbaaab, aaabbbaaa, aaabbbbbb, aabaaabba, aabbaaaba, aabbbaaaa, aabbbabbb, aabbbbbba, abaaabbaa, abbaaabaa, abbbaaaaa, abbbaabbb, abbbabbba, abbbbbbaa.
Square array A(n,k) begins:
1, 1, 1, 1, 1, 1, 1, ...
0, 1, 1, 1, 1, 1, 1, ...
0, 1, 4, 7, 10, 13, 16, ...
0, 1, 19, 61, 127, 217, 331, ...
0, 1, 98, 591, 1810, 4085, 7746, ...
0, 1, 531, 6101, 27631, 82593, 195011, ...
0, 1, 2974, 65719, 441604, 1751197, 5153626, ...