TOPICS
Search

Silverman's Sequence


Silverman's sequence is the nondecreasing sequence f(1),f(2),... of positive integers with f(1)=1 in which each positive integer n occurs exactly f(n) times. The first few terms are 1, 2, 2, 3, 3, 4, 4, 4, 5, 5, 5, ... (OEIS A001462).

The asymptotic behavior is f(n)∼phi^(2-phi)n^(phi-1) as n->infty (Pétermann et al. 1999, p. 212), where phi is the golden ratio.


Explore with Wolfram|Alpha

References

Guy, R. K. "Silverman's Sequences." §E25 in Unsolved Problems in Number Theory, 2nd ed. New York: Springer-Verlag, pp. 225-226, 1994.Pétermann, Y.-F. S.; Rémy, J.-L.; and Vardi, I. "On a Functional-Differential Equation Related to Golomb's Self-Described Sequence." J. Théor. Nombres Bordeaux 11, 211-230, 1999. https://doi.org/10.5802/jtnb.247.Sloane, N. J. A. Sequence A001462/M0257 in "The On-Line Encyclopedia of Integer Sequences."

Referenced on Wolfram|Alpha

Silverman's Sequence

Cite this as:

Weisstein, Eric W. "Silverman's Sequence." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/SilvermansSequence.html

Subject classifications