login
This site is supported by donations to The OEIS Foundation.

 

Logo

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!)
A214898 Conway's subprime Fibonacci sequence, largest loop elements. 9
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 * A230396 A028485 A034227

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

License Agreements, Terms of Use, Privacy Policy .

Last modified November 19 03:53 EST 2017. Contains 294912 sequences.