Search: id:A129282
Results 1-1 of 1 results found.

%I A129282
%S A129282 1,2,4,5,9,14,17,24,32,41,46,47,59,60,74,89,105,122,131,132,152,173,195,
%T A129282 218,242,247,260,269,283,284,314,315,347,380,397,432,468,505,543,582,
%U A129282 602,643,664,707,751,796,842,889,937,944,954,971,1023,1076,1130,1141
%N A129282 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 A129282 Leroy Quet, <a href="http://www.prism-of-spirals.net/">Home Page</a> 
               (listed in lieu of email address)
%e A129282 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 A129282 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 A129282 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 (deutsch(AT)duke.poly.edu), 
               Apr 11 2007
%Y A129282 Cf. A129281.
%Y A129282 Sequence in context: A118550 A126697 A162406 this_sequence A073153 A073154 
               A077882
%Y A129282 Adjacent sequences: A129279 A129280 A129281 this_sequence A129283 A129284 
               A129285
%K A129282 nonn
%O A129282 0,2
%A A129282 Leroy Quet Apr 07 2007
%E A129282 More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 11 2007

Search completed in 0.001 seconds