The Yellowstone Permutation is a sequence of positive integers, defined by the following rules:
  • No term is repeated.
  • Given n terms, the next term, a(n+1), is always the smallest possible integer.
  • Every term, a(n), must be relatively prime to the previous term, a(n-1).
  • Every term, a(n), must have a common divisor greater than 1 with the term before the previous, a(n-2).
The first three terms of the sequence, after which we start applying the rules, are [1 2 3].
Given a positive integer, n, return the n-th term of the sequence, a(n).
Example:
n = 4;
a = 4
Solve

Solution Stats

10 Solutions

9 Solvers

Last Solution submitted on Jul 22, 2026

Last 200 Solutions

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers9

Chris Cleveland ChrisR Dyuman Joshi Lorenzo

Suggested Problems

More from this Author45

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!