\magnification=1200
\hsize=4in
\overfullrule=0pt
\input amssym
%\def\frac#1 #2 {{#1\over #2}}
\def\emph#1{{\it #1}}
\def\em{\it}
\nopagenumbers
\noindent
%
%
{\bf Brad Jackson and Frank Ruskey}
%
%
\medskip
\noindent
%
%
{\bf Meta-Fibonacci Sequences, Binary Trees and Extremal Compact Codes}
%
%
\vskip 5mm
\noindent
%
%
%
%
We consider a family of meta-Fibonacci sequences which arise in
studying the number of leaves at the largest level in certain infinite
sequences of binary trees, restricted compositions of an integer, and
binary compact codes. For this family of meta-Fibonacci sequences and
two families of related sequences we derive ordinary generating
functions and recurrence relations. Included in these families of
sequences are several well-known sequences in the Online Encyclopedia
of Integer Sequences (OEIS).
\bye