login

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A076560
a(1)=1; a(n>1)= greatest prime divisor of (a(n-1) + n).
3
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
OFFSET
1,2
LINKS
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 *)
PROG
(PARI) gpf(n) = if(n==1, 1, my(v=factor(n)[, 1]); v[#v]);
a_vector(len) = my(t=0); vector(len, n, t=gpf(t+n)); \\ Kevin Ryde, Jun 21 2023
CROSSREFS
Cf. A006530 (gpf), A362138.
Sequence in context: A367034 A366982 A366973 * A359048 A096915 A249806
KEYWORD
easy,nonn
AUTHOR
Zak Seidov, Oct 19 2002
EXTENSIONS
Definition clarified by Harvey P. Dale, Nov 29 2013
STATUS
approved