This site is supported by donations to The OEIS Foundation.

 Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS". Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A214897 Conway's subprime Fibonacci sequence: cycle lengths. 2
 1, 10, 11, 18, 19, 56, 136 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Similar to the Fibonacci recursion starting with a pair of positive integers, but each new nonprime term is divided by its least prime factor. The recursion enters a loop of length a(n) after a finite number of steps. Conjecture: the list of loops is complete (checked to [10^5, 10^5]), loops of length a(n) are unique and no infinite chains exist. LINKS Richard K. Guy, Tanya Khovanova and Julian Salazar, Conway's subprime Fibonacci sequences, arXiv:1207.5099v1 [math.NT] MATHEMATICA see A214674 CROSSREFS Cf. A000045, A020639, A175723, A214551, A014682, A214674, A214892-A214898. Sequence in context: A112787 A264719 A214792 * A037307 A225079 A214790 Adjacent sequences:  A214894 A214895 A214896 * A214898 A214899 A214900 KEYWORD nonn AUTHOR Wouter Meeussen, Jul 29 2012 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.