For n < 4 the constraint is voidly satisfied: each of the n-digit words satisfies the definition since there is no subword of length 4. - M. F. Hasler, Jan 13 2015
Join[{1, 3, 9, 27}, LinearRecurrence[{1, 1, 1}, {36, 72, 132}, 30]] (* Harvey P. Dale, Mar 12 2015 *)
PROG
(PARI) Vec((1+2*x+5*x^2+14*x^3-3*x^4-3*x^6)/(1-x-x^2-x^3) + O(x^100)) \\ Colin Barker, Jan 12 2015; extended to indices 0..3 by M. F. Hasler, Jan 13 2015