Abstract: It's the age-old recurrence with a twist: sum the last two terms and if the result is composite, divide by its smallest prime divisor to get the next term (e.g., 0, 1, 1, 2, 3, 5, 4, 3, 7, ...). These sequences exhibit pseudo-random behaviour and generally terminate in a handful of cycles, properties reminiscent of 3x+1 and related sequences. We examine the elementary properties of these 'subprime' Fibonacci sequences.
Recommendations
Cited in
(13)- Conway's work on iteration
- Sorted fibs in base 3/2
- Free Fibonacci sequences
- The toothpick sequence and other sequences from cellular automata
- A note on prime Fibonacci sequences
- On Conway's subprime function, a covering of \(\mathbb N\) and an unexpected appearance of the Golden ratio
- Book Review
- Focusing sequences and self-similarity
- Rumor arrays
- Three’s A Crowd: An Exploration of Subprime Tribonacci Sequences
- The comma sequence: a simple sequence with bizarre properties
- Elementary sequences, sub-Fibonacci sequences
- On Subprime Recurrences
This page was built for publication: Conway's subprime Fibonacci sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3454176)
