Volume 51 |
Number 3 |
August 2013 |
Lawrence Somer and Michal Křížek
Prime Lehmer and Lucas Numbers With Composite Indices
| 194 |
    
Abstract |
Full text
Michael D. Hirschhorn
Estimating the Apéry Numbers II
| 215 |
    
Abstract |
Full text
Jonny Griffiths and Martin Griffiths
Fibonacci-Related Sequences via Iterated QRT Maps
| 218 |
    
Abstract |
Full text
Florian Luca and Laszlo Szalay
On the Counting Function of Triples Whose Pairwise Products
Are Close to Fibonacci Numbers
| 228 |
    
Abstract |
Full text
Diego Marques
Sharper Upper Bounds for the Order of Appearance in the Fibonacci Sequence
| 233 |
    
Abstract |
Full text
G. K. Panda and S. S. Rout
Gap Balancing Numbers
| 239 |
    
Abstract |
Full text
Connor Ahlbach, Jeremy Usatine, Christiane Frougny, and Nicholas Pippenger
Efficient Algorithms for Zeckendorf Arithmetic
| 249 |
    
Abstract |
Full text
Michael D.Hirschhorn
A Naive Proof that F5n ≡ 0 (mod 5)
| 256 |
    
Abstract |
Full text
Daryl Deford
Counting Rearrangements on Generalized Wheel Graphs
| 259 |
    
Abstract |
Full text
Nils Gaute Voll
Some Identities for Four Term Recurrence Relations
| 268 |
    
Abstract |
Full text
Elementary Problems and Solutions
(Edited by Russ Euler and Jawad Sadek)
| 274 |
    
Full text
Advanced Problems and Solutions
(Edited by Florian Luca)
| 282 |
    
Full text
Fibonacci Conference Announcement
| 288 |
    
Full text
|