\documentclass[12pt,reqno]{article}

\usepackage[usenames]{color}
\usepackage{amssymb}
\usepackage{graphicx}
\usepackage{amscd}

\usepackage[colorlinks=true,
linkcolor=webgreen,
filecolor=webbrown,
citecolor=webgreen]{hyperref}

\definecolor{webgreen}{rgb}{0,.5,0}
\definecolor{webbrown}{rgb}{.6,0,0}

\usepackage{color}
\usepackage{fullpage}
\usepackage{float}

\usepackage{psfig}
\usepackage{graphics,amsmath,amssymb}
\usepackage{amsthm}
\usepackage{amsfonts}
\usepackage{latexsym}
\usepackage{epsf}

\setlength{\textwidth}{6.5in}
\setlength{\oddsidemargin}{.1in}
\setlength{\evensidemargin}{.1in}
\setlength{\topmargin}{-.5in}
\setlength{\textheight}{8.9in}

\newcommand{\seqnum}[1]{\href{http://www.research.att.com/cgi-bin/access.cgi/as/~njas/sequences/eisA.cgi?Anum=#1}{\underline{#1}}}

\begin{document}

\begin{abstract} 
We discuss the partial infinite sum $\sum_{k=n}^{\infty}u_k^{-s}$ for
some positive integer $n$, where $u_k$ satisfies a recurrence relation
of order $s$, $u_n= a u_{n-1}+u_{n-2}+\cdots+u_{n-s}$ ($n\ge s$),
with initial values $u_0\ge 0$, $u_k\in\mathbb N$ ($0\le k\le s-1$),
where $a$ and $s(\ge 2)$ are positive integers. If $a=1$, $s=2$, and
$u_0=0$, $u_1=1$, then $u_k=F_k$ is the $k$-th Fibonacci number. Our
results include some extensions of Ohtsuka and Nakamura. We also
consider continued fraction expansions that include such infinite
sums.
\end{abstract}

\end{document}

                                                                                

