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

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A076560 a(1)=1; a(n>1)= greatest prime divisor of (a(n-1) + n). 2
 1, 3, 3, 7, 3, 3, 5, 13, 11, 7, 3, 5, 3, 17, 2, 3, 5, 23, 7, 3, 3, 5, 7, 31, 7, 11, 19, 47, 19, 7, 19, 17, 5, 13, 3, 13, 5, 43, 41, 3, 11, 53, 3, 47, 23, 23, 7, 11, 5, 11, 31, 83, 17, 71, 7, 7, 2, 5, 2, 31, 23, 17, 5, 23, 11, 11, 13, 3, 3, 73, 3, 5, 13, 29, 13, 89, 83, 23, 17, 97, 89, 19 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Harvey P. Dale, Table of n, a(n) for n = 1..1000 MATHEMATICA nxt[{n_, a_}]:={n+1, FactorInteger[a+n+1][[-1, 1]]}; Transpose[NestList[nxt, {1, 1}, 90]][[2]] (* Harvey P. Dale, Nov 29 2013 *) CROSSREFS Sequence in context: A256784 A324543 A089488 * A096915 A249806 A249382 Adjacent sequences:  A076557 A076558 A076559 * A076561 A076562 A076563 KEYWORD easy,nonn AUTHOR Zak Seidov, Oct 19 2002 EXTENSIONS Definition clarified by Harvey P. Dale, Nov 29 2013 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.

Last modified January 21 13:55 EST 2020. Contains 331113 sequences. (Running on oeis4.)