\BOOKMARK [1][-]{section.1}{Introduction}{}% 1
\BOOKMARK [1][-]{section.2}{Sufficient conditions for log-balancedness}{}% 2
\BOOKMARK [1][-]{section.3}{Log-balancedness of some sequences}{}% 3
\BOOKMARK [2][-]{subsection.3.1}{The derangement numbers}{section.3}% 4
\BOOKMARK [2][-]{subsection.3.2}{Numbers counting tree-like polyhexes}{section.3}% 5
\BOOKMARK [2][-]{subsection.3.3}{Numbers counting walks on the cubic lattice}{section.3}% 6
\BOOKMARK [2][-]{subsection.3.4}{Numbers counting a class of arrays}{section.3}% 7
\BOOKMARK [2][-]{subsection.3.5}{Numbers satisfying a three-term recurrence}{section.3}% 8
\BOOKMARK [2][-]{subsection.3.6}{Numbers counting bipermutations}{section.3}% 9
\BOOKMARK [2][-]{subsection.3.7}{Numbers satisfying a four-term recurrence \(``minus" case\)}{section.3}% 10
\BOOKMARK [2][-]{subsection.3.8}{Numbers satisfying a four-term recurrence \(``plus" case\)}{section.3}% 11
\BOOKMARK [2][-]{subsection.3.9}{Numbers counting permutation with ordered orbits}{section.3}% 12
\BOOKMARK [2][-]{subsection.3.10}{The Domb numbers}{section.3}% 13
\BOOKMARK [2][-]{subsection.3.11}{Numbers counting a class of nn symmetric matrices}{section.3}% 14
\BOOKMARK [2][-]{subsection.3.12}{The harmonic numbers}{section.3}% 15
\BOOKMARK [2][-]{subsection.3.13}{The Fibonacci and Lucas numbers}{section.3}% 16
\BOOKMARK [1][-]{section.4}{Conclusions}{}% 17
\BOOKMARK [1][-]{section.5}{Acknowledgment}{}% 18