Abstract
We give an in-depth analysis of an algorithm, introduced by Kimberling in the On-Line Encyclopedia of Integer Sequences, that generates permutations of the natural numbers. It turns out that each example of such a permutation in the Encyclopedia is completely determined by some 3-automatic sequence.
Original language | English |
---|---|
Number of pages | 10 |
Edition | 4 |
Volume | 23 |
Publication status | Published - 2020 |
Publication series
Name | Journal of Integer Sequences |
---|---|
Publisher | University of Waterloo |
ISSN (Print) | 1530-7638 |
Keywords
- 3-automatic sequence
- Morphic word
- Permutation of N