login
a(1)=2. a(n) = the smallest multiple of {the largest proper divisor of n} that is > a(n-1).
1

%I #7 Mar 11 2014 01:32:45

%S 2,3,4,6,7,9,10,12,15,20,21,24,25,28,30,32,33,36,37,40,42,44,45,48,50,

%T 52,54,56,57,60,61,64,66,68,70,72,73,76,78,80,81,84,85,88,90,92,93,96,

%U 98,100,102,104,105,108,110,112,114,116,117,120,121,124,126,128,130,132

%N a(1)=2. a(n) = the smallest multiple of {the largest proper divisor of n} that is > a(n-1).

%C If a(1) equaled 1 instead, we would instead have a(n) = n for all n, of course.

%Y Cf. A032742, A164529.

%K nonn

%O 1,1

%A _Leroy Quet_, Aug 15 2009

%E Extended by _Ray Chandler_, Mar 15 2010