mallows sequence - Wolfram|Alpha

Uh oh! Wolfram|Alpha doesn't run without JavaScript.

Please enable JavaScript. If you don't know how, you can find instructionshere.Once you've done that, refresh this page to start using Wolfram|Alpha.

Input interpretation

Mallows' sequence

Definition

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).

More information »

Related terms

Hofstadter-Conway $10, 000 sequence | Hofstadter's Q-sequence

Subject classifications

MathWorld

recurrence equations | sequences

MSC 2010

11Bxx | 65Q10 | 65Q30

POWERED BY THE WOLFRAM LANGUAGE

Related Queries:

Have a question about using Wolfram|Alpha?Contact Pro Premium Expert Support »

Give us your feedback »