On a strange recursion of Golomb
The electronic journal of combinatorics, Tome 3 (1996) no. 1
Golomb proposed a family of "strange" recursions of metafibonacci type, parameterized by $k$, and, for each $k$, identified what he speculated was the unique increasing solution. We show that, to the contrary, there are many increasing solutions for each $k$, and we indicate explicitly how to construct them. We also provide some additional general results concerning the nature of the strictly increasing solutions for this unusual family of recursions.
DOI :
10.37236/1232
Classification :
11B37
Mots-clés : recursion of Golomb, recursions of metafibonacci type
Mots-clés : recursion of Golomb, recursions of metafibonacci type
@article{10_37236_1232,
author = {Ed Barbeau and Steve Tanny},
title = {On a strange recursion of {Golomb}},
journal = {The electronic journal of combinatorics},
year = {1996},
volume = {3},
number = {1},
doi = {10.37236/1232},
zbl = {0853.11011},
url = {http://geodesic.mathdoc.fr/articles/10.37236/1232/}
}
Ed Barbeau; Steve Tanny. On a strange recursion of Golomb. The electronic journal of combinatorics, Tome 3 (1996) no. 1. doi: 10.37236/1232
Cité par Sources :