Yellowstone sequence: Difference between revisions
Content added Content deleted
| Line 4: | Line 4: | ||
The '''Yellowstone sequence''', also called the '''Yellowstone permutation''', is defined as: |
The '''Yellowstone sequence''', also called the '''Yellowstone permutation''', is defined as: |
||
a(n) = n for n <= 3. |
====a(n) = n for n <= 3. ==== |
||
For n >= 4, |
For n >= 4, |
||
a(n) |
====a(n) = the smallest number not already in sequence such that a(n) is relatively prime to a(n-1) and is not relatively prime to a(n-2).==== |
||
The sequence is a permutation of the natural numbers, and gets its name from what its authors felt was a spiking, fountain like appearance of a plot of the sequence. |
The sequence is a permutation of the natural numbers, and gets its name from what its authors felt was a spiking, fountain like appearance of a plot of the sequence. |
||