![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextgreen.png)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextred.png)
![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextgreen.png)
![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltext_open_medium.gif)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextred.png)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltext_restricted_medium.gif)
Counting Terms Un of Third Order Linear Recurrences with Un = U2 + nv2
Subscribe/Renew Journal
Given a recurrent sequence U := {Un}n≥0 we consider the problem of counting MU(x), the number of integers n ≤ x such that Un = u2 + nv2 for some integers u, v. We will show that MU(x) ⪻ x(log x)−0.05 for a large class of ternary sequences. Our method uses many ingredients from the proof of Alba Gonzalez and the second author [1] that MF (x) ⪻ x(log x)−0.06, with F the Fibonacci sequence.
User
Subscription
Login to verify subscription
Font Size
Information
![](https://i-scholar.in/public/site/images/abstractview.png)
Abstract Views: 218
![](https://i-scholar.in/public/site/images/pdfview.png)
PDF Views: 1