login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A076562 a(1)=3; a(n>1)= greatest prime divisor of a(n-1) + n. 1

%I #11 Apr 14 2015 22:02:54

%S 3,5,2,3,2,2,3,11,5,5,2,7,5,19,17,11,7,5,3,23,11,11,17,41,11,37,2,5,

%T 17,47,13,5,19,53,11,47,7,5,11,17,29,71,19,7,13,59,53,101,5,11,31,83,

%U 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

%N a(1)=3; a(n>1)= greatest prime divisor of a(n-1) + n.

%C Starting with 4th term the sequence coincides with sequence with a(1)=2. Also starting with 49th term both sequence coincide with the sequence with a(1)=1! Surprisingly, the sequence with a(1)=4&5 also coincide with all above sequence starting with 49th term.

%H Harvey P. Dale, <a href="/A076562/b076562.txt">Table of n, a(n) for n = 1..1000</a>

%t nxt[{n_,a_}]:={n+1,FactorInteger[a+n+1][[-1,1]]}; Transpose[NestList[nxt,{1,3},80]][[2]] (* _Harvey P. Dale_, Apr 14 2015 *)

%K easy,nonn

%O 1,1

%A _Zak Seidov_, Oct 19 2002

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 12:53 EDT 2024. Contains 371969 sequences. (Running on oeis4.)