Key points are not available for this paper at this time.
Abstract.In this paper, we establish a system of recurrence relations and an algorithm for finding the generating function Ak(x) for the number of words over alphabet k of length n that avoid 1243, for arbitrary k. In particular, we present an explicit formula for the generating function Ak(x) for 1 ≤ k ≤ 10.Mathematics Subject Classification (2020): 05A1505A05Key words: k-ary wordskernel methodavoiding 1243
Toufik Mansour (2024) studied this question.