login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A214898 Conway's subprime Fibonacci sequence, largest loop elements. 10
2, 827, 607, 239, 191, 5693, 347 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

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. Recursion enters a loop of length A214897(n), of which the largest element a(n) is prime (this sequence).

LINKS

Table of n, a(n) for n=1..7.

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: A243409 A281195 A109555 * A332182 A230396 A028485

Adjacent sequences:  A214895 A214896 A214897 * A214899 A214900 A214901

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
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 7 13:08 EST 2021. Contains 349581 sequences. (Running on oeis4.)