Kása, Zoltán On scattered subword complexity. (English) Zbl 1237.68135 Acta Univ. Sapientiae, Inform. 3, No. 1, 127-136 (2011). Summary: Special scattered subwords, in which the gaps are of length from a given set, are defined. The scattered subword complexity, which is the number of such scattered subwords, is computed for rainbow words. Cited in 2 Documents MSC: 68R15 Combinatorics on words Keywords:word complexity; scattered subword; \(d\)-complexity; super-\(d\)-complexity PDFBibTeX XMLCite \textit{Z. Kása}, Acta Univ. Sapientiae, Inform. 3, No. 1, 127--136 (2011; Zbl 1237.68135) Online Encyclopedia of Integer Sequences: Dying rabbits: a(n) = a(n-1) + a(n-2) - a(n-5). a(n) is the number of subsequences {s(k)} of {1,2,3,...n} such that s(k+1)-s(k) is 1 or 3.