Counting Binary Words Avoiding Alternating Patterns
Stefano Bilotta, Elisabetta Grazzini, and Elisa Pergola
Dipartimento di Sistemi e Informatica
Università di Firenze
Viale G. B. Morgagni 65
50134 Firenze
Italy
Abstract:
Let F[p] denote the set of binary words, with no more 0's
than 1's, that do not contain the pattern
p = (10)j1 as a factor for any fixed j ≥ 1. We give the generating
function for the integer sequence enumerating, according to the
number of 1's, the words in F[p].
Full version: pdf,
dvi,
ps,
latex
(Concerned with sequence
A225034.)
Received November 27 2012;
revised version received May 3 2013.
Published in Journal of Integer Sequences, May 8 2013.
Return to
Journal of Integer Sequences home page
