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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A101504 a(n+1)=a(n)/x+x, with x = Max(a(k): 0<=k

%I #6 Aug 24 2016 18:11:36

%S 1,1,2,3,4,4,5,6,5,6,7,8,6,7,8,9,6,7,8,9,10,7,8,9,10,11,12,8,9,10,11,

%T 12,13,14,9,10,11,12,13,14,15,8,9,10,11,12,13,14,15,16,10,11,12,13,14,

%U 15,16,17,18,11,12,13,14,15,16,17,18,19,20,12,13,14,15,16,17,18,19,20,21

%N a(n+1)=a(n)/x+x, with x = Max(a(k): 0<=k<n and a(k)|a(n)), a(0)=a(1)=1.

%C a(n)>a(n+1) iff a(n) is composite and a(n)>Max(a(k):0<=k<n);

%C a(A101505(n)) = n and a(m) < n for m < A101505(n).

%H Ivan Neretin, <a href="/A101504/b101504.txt">Table of n, a(n) for n = 0..10000</a>

%t Nest[Append[#, (x = Max@Intersection[Most@#, Divisors[#[[-1]]]]) + #[[-1]]/x] &, {1, 1}, 77] (* _Ivan Neretin_, Aug 24 2016 *)

%K nonn

%O 0,3

%A _Reinhard Zumkeller_, Dec 05 2004

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.

Last modified July 22 16:15 EDT 2024. Contains 374540 sequences. (Running on oeis4.)