\relax 
\providecommand\hyper@newdestlabel[2]{}
\providecommand\HyperFirstAtBeginDocument{\AtBeginDocument}
\HyperFirstAtBeginDocument{\ifx\hyper@anchor\@undefined
\global\let\oldcontentsline\contentsline
\gdef\contentsline#1#2#3#4{\oldcontentsline{#1}{#2}{#3}}
\global\let\oldnewlabel\newlabel
\gdef\newlabel#1#2{\newlabelxx{#1}#2}
\gdef\newlabelxx#1#2#3#4#5#6{\oldnewlabel{#1}{{#2}{#3}}}
\AtEndDocument{\ifx\hyper@anchor\@undefined
\let\contentsline\oldcontentsline
\let\newlabel\oldnewlabel
\fi}
\fi}
\global\let\hyper@last\relax 
\gdef\HyperFirstAtBeginDocument#1{#1}
\providecommand*\HyPL@Entry[1]{}
\citation{GO80}
\citation{GO81}
\citation{SF96}
\HyPL@Entry{0<</S/D>>}
\@writefile{toc}{\contentsline {section}{\numberline {1}Introduction}{1}{section.1}}
\newlabel{sec:introduction}{{1}{1}{Introduction}{section.1}{}}
\citation{MS11}
\@writefile{lot}{\contentsline {table}{\numberline {1}{\ignorespaces The autocorrelation vector for $\mathfrak  {p}= 10101$.}}{2}{table.1}}
\newlabel{auto}{{1}{2}{The autocorrelation vector for $\mathfrak {p}= 10101$}{table.1}{}}
\newlabel{defrp}{{1}{2}{Riordan pattern}{theorem.1}{}}
\citation{SGWW91}
\citation{MRSV97}
\citation{LMMS14}
\citation{Spr94}
\citation{MSV09}
\@writefile{lot}{\contentsline {table}{\numberline {2}{\ignorespaces The Riordan patterns of length 7 with first bit equal to $1$ and their correlation polynomials}}{3}{table.2}}
\newlabel{tutti7}{{2}{3}{The Riordan patterns of length 7 with first bit equal to $1$ and their correlation polynomials}{table.2}{}}
\newlabel{bgf}{{1}{3}{Introduction}{equation.1.1}{}}
\newlabel{somme}{{2}{3}{Introduction}{equation.1.2}{}}
\citation{MS11}
\citation{BMS07a}
\newlabel{main}{{2}{4}{}{theorem.2}{}}
\@writefile{lot}{\contentsline {table}{\numberline {3}{\ignorespaces The matrix ${\cal  {F}^{[\mathfrak  {p}]}}$ for $\mathfrak  {p}=10101$}}{4}{table.3}}
\newlabel{Fprimo}{{3}{4}{The matrix ${\cal {F}^{[\mathfrak {p}]}}$ for $\mathfrak {p}=10101$}{table.3}{}}
\citation{MS11}
\citation{OEIS}
\citation{MS11}
\@writefile{lot}{\contentsline {table}{\numberline {4}{\ignorespaces  ${\cal  {R}^{[\mathfrak  {p}]}}$ for $\mathfrak  {p}=10101$}}{5}{table.4}}
\newlabel{Rprimoa}{{4}{5}{${\cal {R}^{[\mathfrak {p}]}}$ for $\mathfrak {p}=10101$}{table.4}{}}
\@writefile{lot}{\contentsline {table}{\numberline {5}{\ignorespaces  ${\cal  {R}^{[\mathaccentV {bar}016{\mathfrak  {p}]}}}$ for $\mathfrak  {p}=10101$}}{5}{table.5}}
\newlabel{Rprimob}{{5}{5}{${\cal {R}^{[\bar {\mathfrak {p}]}}}$ for $\mathfrak {p}=10101$}{table.5}{}}
\@writefile{toc}{\contentsline {section}{\numberline {2}Riordan arrays for Riordan patterns}{6}{section.2}}
\newlabel{teo1}{{4}{6}{}{theorem.4}{}}
\newlabel{teo2}{{5}{7}{}{theorem.5}{}}
\newlabel{teo3}{{6}{7}{}{theorem.6}{}}
\newlabel{corodh}{{7}{8}{}{theorem.7}{}}
\newlabel{coroS}{{8}{9}{}{theorem.8}{}}
\citation{BGP13}
\@writefile{lot}{\contentsline {table}{\numberline {6}{\ignorespaces Some expansions for $S^{[1^{j+1}0^j]}(t)$ and the set of words with $n=3$ $1$-bits, avoiding pattern $\mathfrak  {p}=110$, so $j=1$ in the family; moreover, for $j=1$ the sequence corresponds to \href  {http://oeis.org/A000225}{\relax $\@@underline {\hbox {A000225}}\mathsurround \z@ $\relax }, for $j=2$ the sequence corresponds to \href  {http://oeis.org/A261058}{\relax $\@@underline {\hbox {A261058}}\mathsurround \z@ $\relax }.}}{10}{table.6}}
\newlabel{tbl:S1_j1:0_j}{{6}{10}{Some expansions for $S^{[1^{j+1}0^j]}(t)$ and the set of words with $n=3$ $1$-bits, avoiding pattern $\mathfrak {p}=110$, so $j=1$ in the family; moreover, for $j=1$ the sequence corresponds to \seqnum {A000225}, for $j=2$ the sequence corresponds to \seqnum {A261058}}{table.6}{}}
\@writefile{lot}{\contentsline {table}{\numberline {7}{\ignorespaces Some expansions for $S^{[0^{j+1}1^j]}(t)$ and the set of words with $n=3$ $1$-bits, avoiding pattern $\mathfrak  {p}=001$, so $j=1$ in the family; moreover, for $j=1$ the sequence corresponds to \href  {http://oeis.org/A001792}{\relax $\@@underline {\hbox {A001792}}\mathsurround \z@ $\relax }.}}{11}{table.7}}
\newlabel{tbl:S0_j1:1_j}{{7}{11}{Some expansions for $S^{[0^{j+1}1^j]}(t)$ and the set of words with $n=3$ $1$-bits, avoiding pattern $\mathfrak {p}=001$, so $j=1$ in the family; moreover, for $j=1$ the sequence corresponds to \seqnum {A001792}}{table.7}{}}
\@writefile{lot}{\contentsline {table}{\numberline {8}{\ignorespaces Some expansions for $S^{[0^{j}1^j]}(t)$ (or, equivalently, $S^{[1^{j}0^{j}]}(t)$) and the set of words with $n=8$ $1$-bits, avoiding pattern $\mathfrak  {p}=01$ (or, equivalently, $\mathfrak  {p}=10$), so $j=1$ in the family; moreover, for $j=0$ the sequence corresponds to \href  {http://oeis.org/A001700}{\relax $\@@underline {\hbox {A001700}}\mathsurround \z@ $\relax }, for $j=1$ the sequence corresponds to \href  {http://oeis.org/A001477}{\relax $\@@underline {\hbox {A001477}}\mathsurround \z@ $\relax }.}}{11}{table.8}}
\newlabel{tbl:S0_j:1_j}{{8}{11}{Some expansions for $S^{[0^{j}1^j]}(t)$ (or, equivalently, $S^{[1^{j}0^{j}]}(t)$) and the set of words with $n=8$ $1$-bits, avoiding pattern $\mathfrak {p}=01$ (or, equivalently, $\mathfrak {p}=10$), so $j=1$ in the family; moreover, for $j=0$ the sequence corresponds to \seqnum {A001700}, for $j=1$ the sequence corresponds to \seqnum {A001477}}{table.8}{}}
\@writefile{lot}{\contentsline {table}{\numberline {9}{\ignorespaces Some expansions for $S^{[(10)^{j}1]}(t)$ and the set of words with $n=3$ $1$-bits, avoiding pattern $\mathfrak  {p}=101$, so $j=1$ in the family; moreover, for $j=1$ the sequence corresponds to \href  {http://oeis.org/A225034}{\relax $\@@underline {\hbox {A225034}}\mathsurround \z@ $\relax }.}}{12}{table.9}}
\newlabel{tbl:S10_j:1}{{9}{12}{Some expansions for $S^{[(10)^{j}1]}(t)$ and the set of words with $n=3$ $1$-bits, avoiding pattern $\mathfrak {p}=101$, so $j=1$ in the family; moreover, for $j=1$ the sequence corresponds to \seqnum {A225034}}{table.9}{}}
\@writefile{lot}{\contentsline {table}{\numberline {10}{\ignorespaces Some expansions for $S^{[(01)^{j}0]}(t)$ and the set of words with $n=3$ $1$-bits, avoiding pattern $\mathfrak  {p}=010$, so $j=1$ in the family; moreover, for $j=1$ the sequence corresponds to \href  {http://oeis.org/A025566}{\relax $\@@underline {\hbox {A025566}}\mathsurround \z@ $\relax }.}}{12}{table.10}}
\newlabel{tbl:S01_j:0}{{10}{12}{Some expansions for $S^{[(01)^{j}0]}(t)$ and the set of words with $n=3$ $1$-bits, avoiding pattern $\mathfrak {p}=010$, so $j=1$ in the family; moreover, for $j=1$ the sequence corresponds to \seqnum {A025566}}{table.10}{}}
\newlabel{coroL}{{9}{13}{}{theorem.9}{}}
\@writefile{lot}{\contentsline {table}{\numberline {11}{\ignorespaces Some expansions for $L^{[1^{j+1}0^j]}(t)$; moreover, for $j=1$ the sequence corresponds to \href  {http://oeis.org/A052551}{\relax $\@@underline {\hbox {A052551}}\mathsurround \z@ $\relax }.}}{14}{table.11}}
\newlabel{tbl:L1_j1:0_j}{{11}{14}{Some expansions for $L^{[1^{j+1}0^j]}(t)$; moreover, for $j=1$ the sequence corresponds to \seqnum {A052551}}{table.11}{}}
\@writefile{lot}{\contentsline {table}{\numberline {12}{\ignorespaces Some expansions for $L^{[0^{j+1}1^j]}(t)$; moreover, for $j=1$ the sequence corresponds to \href  {http://oeis.org/A079284}{\relax $\@@underline {\hbox {A079284}}\mathsurround \z@ $\relax }.}}{14}{table.12}}
\newlabel{tbl:L0_j1:1_j}{{12}{14}{Some expansions for $L^{[0^{j+1}1^j]}(t)$; moreover, for $j=1$ the sequence corresponds to \seqnum {A079284}}{table.12}{}}
\@writefile{lot}{\contentsline {table}{\numberline {13}{\ignorespaces Some expansions for $L^{[0^{j}1^j]}(t)$ (or, equivalently, $L^{[1^{j}0^j]}(t)$); moreover, for $j=0$ the sequence corresponds to \href  {http://oeis.org/A027306}{\relax $\@@underline {\hbox {A027306}}\mathsurround \z@ $\relax }, for $j=1$ the sequence corresponds to \href  {http://oeis.org/A008619}{\relax $\@@underline {\hbox {A008619}}\mathsurround \z@ $\relax }.}}{14}{table.13}}
\newlabel{tbl:L0_j:1_j}{{13}{14}{Some expansions for $L^{[0^{j}1^j]}(t)$ (or, equivalently, $L^{[1^{j}0^j]}(t)$); moreover, for $j=0$ the sequence corresponds to \seqnum {A027306}, for $j=1$ the sequence corresponds to \seqnum {A008619}}{table.13}{}}
\@writefile{lot}{\contentsline {table}{\numberline {14}{\ignorespaces Some expansions for $L^{[(10)^{j}1]}(t)$; moreover, no sequence is known in the literature, except for $j=0$.}}{15}{table.14}}
\newlabel{tbl:L10_j:1}{{14}{15}{Some expansions for $L^{[(10)^{j}1]}(t)$; moreover, no sequence is known in the literature, except for $j=0$}{table.14}{}}
\@writefile{lot}{\contentsline {table}{\numberline {15}{\ignorespaces Some expansions for $L^{[(01)^{j}0]}(t)$; moreover, no sequence is known in literature, except for $j=0$.}}{15}{table.15}}
\newlabel{tbl:L01_j:0}{{15}{15}{Some expansions for $L^{[(01)^{j}0]}(t)$; moreover, no sequence is known in literature, except for $j=0$}{table.15}{}}
\@writefile{toc}{\contentsline {section}{\numberline {3}Some combinatorial interpretations}{15}{section.3}}
\@writefile{toc}{\contentsline {subsection}{\numberline {3.1}Enumeration with respect to the number of $1$-bits}{15}{subsection.3.1}}
\newlabel{coro:1_j1_0_j}{{10}{15}{}{theorem.10}{}}
\newlabel{coro:0_j1_1_j}{{11}{17}{}{theorem.11}{}}
\citation{Ardila}
\newlabel{powers3}{{3}{19}{Enumeration with respect to the number of $1$-bits}{equation.3.3}{}}
\@writefile{lot}{\contentsline {table}{\numberline {16}{\ignorespaces The Motzkin triangle corresponding to the Riordan array $\left (M(t),tM(t)\right )$ and to sequence \href  {http://oeis.org/A064189}{\relax $\@@underline {\hbox {A064189}}\mathsurround \z@ $\relax }. Multiplying the matrix by the column vector $(1,2,2,2,2,\ldots  )$ we get the sequence $S_{n}^{[\mathfrak  {010}]}=(1,3,8,22,61, \cdots  )$. Similarly, with matrix $\left (1+tM(t),tM(t)\right )$ we get the sequence $S_{n}^{[\mathfrak  {101}]}=(1, 3, 7, 18, 48, \cdots  )$. }}{19}{table.16}}
\newlabel{Motzkin}{{16}{19}{The Motzkin triangle corresponding to the Riordan array $\left (M(t),tM(t)\right )$ and to sequence \seqnum {A064189}. Multiplying the matrix by the column vector $(1,2,2,2,2,\ldots )$ we get the sequence $S_{n}^{[\mathfrak {010}]}=(1,3,8,22,61, \cdots )$. Similarly, with matrix $\left (1+tM(t),tM(t)\right )$ we get the sequence $S_{n}^{[\mathfrak {101}]}=(1, 3, 7, 18, 48, \cdots )$}{table.16}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {3.2}Enumeration with respect to the length}{19}{subsection.3.2}}
\citation{SGWW91}
\@writefile{toc}{\contentsline {section}{\numberline {4}Conclusions}{22}{section.4}}
\bibcite{Ardila}{1}
\bibcite{BMS07a}{2}
\bibcite{BGP13}{3}
\bibcite{GO80}{4}
\@writefile{toc}{\contentsline {section}{\numberline {5}Acknowledgements}{24}{section.5}}
\bibcite{GO81}{5}
\bibcite{OEIS}{6}
\bibcite{LMMS14}{7}
\bibcite{MRSV97}{8}
\bibcite{MS11}{9}
\bibcite{MSV09}{10}
\bibcite{SF96}{11}
\bibcite{SGWW91}{12}
\bibcite{Spr94}{13}