TOPICS
Search

Mallows' Sequence

An integer sequence given by the recurrence relation

a(n)=a(a(n-2))+a(n-a(n-2))

with a(1)=a(2)=1. The first few values are 1, 1, 2, 3, 3, 4, 5, 6, 6, 7, 7, 8, 9, 10, 10, 11, 12, 12, 13, 14, ... (OEIS A005229).

See also

Hofstadter-Conway $10,000 Sequence, Hofstadter's Q-Sequence

Explore with Wolfram|Alpha

References

Mallows, C. L. "Conway's Challenge Sequence." Amer. Math. Monthly 98, 5-20, 1991.Sloane, N. J. A. Sequence A005229/M0441 in "The On-Line Encyclopedia of Integer Sequences."

Referenced on Wolfram|Alpha

Mallows' Sequence

Cite this as:

Weisstein, Eric W. "Mallows' Sequence." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/MallowsSequence.html

Subject classifications