|
%I #13 Feb 03 2019 06:54:18
%S 1,2,4,5,9,14,17,24,32,41,46,47,59,60,74,89,105,122,131,132,152,173,
%T 195,218,242,247,260,269,283,284,314,315,347,380,397,432,468,505,543,
%U 582,602,643,664,707,751,796,842,889,937,944,954,971,1023,1076,1130,1141
%N a(0)=1; for n > 1, a(n) = a(n-1) + (the largest value of gcd(a(k),n) for 0 <= k <= n-1).
%H Ivan Neretin, <a href="/A129282/b129282.txt">Table of n, a(n) for n = 0..10000</a>
%e For those k where 0 <= k <= 9, gcd(a(3),10) = 5 is the largest value for a gcd(a(k),10). So a(10) = a(9) + 5 = 46.
%e For those k where 0 <= k <= 11, gcd(a(7),12) = 12 is the largest value for a gcd(a(k),12). So a(12) = a(11) + 12 = 59.
%p a[0]:=1: for n from 1 to 70 do a[n]:=a[n-1]+max((seq(gcd(a[k],n),k=0..n-1))) od: seq(a[n],n=0..70); # _Emeric Deutsch_, Apr 11 2007
%t Fold[Append[#1, #1[[-1]] + Max@GCD[#1, #2]] &, {1}, Range[55]] (* _Ivan Neretin_, Oct 24 2018 *)
%Y Cf. A129281.
%K nonn
%O 0,2
%A _Leroy Quet_, Apr 07 2007
%E More terms from _Emeric Deutsch_, Apr 11 2007
|
