In mathematics and computer science, the Recamán's sequence (or Recaman's sequence) is a well known sequence defined by a recurrence relation, because its elements are related to the previous elements in a straightforward way, they are often defined using recursion.
The Recamán's sequence is defined as:
The first terms of the sequence are:
0, 1, 3, 6, 2, 7, 13, 20, 12, 21, 11, 22, 10, 23, 9, 24, 8, 25, 43, 62, 42, 63, 41, 18, 42, 17, 43, 16, 44, 15, 45, 14, 46, 79, 113, 78, 114, 77, 39, 78, 38, 79, 37, 80, 36, 81, 35, 82, 34, 83, 33, 84, 32, 85, 31, 86, 30, 87, 29, 88, 28, 89, 27, 90, 26, 91, 157, 224, 156, 225, 155, ...
On-line encyclopedia of integer sequences (OEIS)
Recamán's sequence was named after its inventor, Colombian mathematician Bernardo Recamán Santos, by Neil Sloane, creator of the On-Line Encyclopedia of Integer Sequences (OEIS). The OEIS entry for this sequence is A005132.
Even when Neil Sloane has collected more than 325,000 sequences since 1964, the Recamán's sequence was referenced in his paper My favorite integer sequences. He also stated that of all the sequences in the OEIS, this one is his favorite to listen to (you can hear it below).
The most-common visualization of the Recamán's sequence is simply plotting its values, such as the figure at right.
On January 14, 2018, the Numberphile YouTube channel published a video titled The Slightly Spooky Recamán Sequence, showing a visualization using alternating semi-circles, as it is shown in the figure at top of this page.
Values of the sequence can be associated with musical notes, in such that case the running of the sequence can be associated with an execution of a musical tune.
The sequence satisfies:
This is not a permutation of the integers: the first repeated term is . Another one is .
Neil Sloane has conjectured that every number eventually appears, but it has not been proved. Even though 1015 terms have been calculated (in 2018), the number 852,655 has not appeared on the list.
The calculation of terms of the sequence can be programmed.
The wiki-based programming chrestomathy website Rosetta Code, in its page Recaman's sequence collects a series of programs in 30+ different programming languages for calculation of terms of the sequence.
The sequence is the most-known sequence invented by Recamán. There is another sequence, less known, defined as:
This OEIS entry is A008336.
- Recaman's sequence. A solution to the task Recaman's sequence in the Rosetta Code, written in Fōrmulæ. The Fōrmulæ wiki. Retrieved September 24, 2019.
- The Slightly Spooky Recamán Sequence, Numberphile video.
- N. J. A. Sloane, Sequences and their Applications (Proceedings of SETA '98), C. Ding, T. Helleseth and H. Niederreiter (editors), Springer-Verlag, London, 1999, pp. 103–130.
- Math less traveled
- S. Farrag and W. Alexan, "Secure 2D Image Steganography Using Recamán's Sequence," 2019 International Conference on Advanced Communication Technologies and Networking (CommNet), Rabat, Morocco, 2019, pp. 1-6. doi: 10.1109/COMMNET.2019.8742368