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

%I A120423
%S A120423 1,1,1,2,2,1,1,2,3,3,3,2,2,2,2,4,4,4,4,3,3,3,3,2,5,5,5,5,5,3,3,4,4,4,4,
%T A120423 6,6,6,6,6,6,3,3,3,3,3,3,4,7,7,7,7,7,7,7,5,5,5,5,3,3,3,3,8,8,8,8,8,8,8,
%U A120423 8,6,6,6,6,6,6,6,6,6,9,9,9,9,9,9,9,9,9,4,4,4,4,4,4,4,4,7,7,10,10,10,10
%N A120423 a(n) = maximum value among all k where 1<=k<=n of GCD(k,floor(n/k)).
%H A120423 Leroy Quet, <a href="http://www.prism-of-spirals.net/">Home Page</a> 
               (listed in lieu of email address)
%e A120423 For n = 10, we have the pairs {k,floor(n/k)} of {1,10},{2,5},{3,3},{4,
               2},{5,2},{6,1},{7,1},{8,1},{9,1},{10,1}. The GCD's of these 10 pairs 
               are 1,1,3,2,1,1,1,1,1,1. Of these, 3 is the largest. So a(10) = 3.
%p A120423 a:=n->max(seq(gcd(k,floor(n/k)),k=1..n)): seq(a(n),n=1..112); - Emeric 
               Deutsch (deutsch(AT)duke.poly.edu), Jul 24 2006
%t A120423 Table[Max[Table[GCD[k, Floor[n/k]], {k, 1, n}]], {n, 1, 100}] - Stefan 
               Steinerberger (stefan.steinerberger(AT)gmail.com), Jul 22 2006
%Y A120423 Sequence in context: A165621 A004739 A156282 this_sequence A113137 A075402 
               A088855
%Y A120423 Adjacent sequences: A120420 A120421 A120422 this_sequence A120424 A120425 
               A120426
%K A120423 nonn
%O A120423 1,4
%A A120423 Leroy Quet Jul 11 2006
%E A120423 More terms from Stefan Steinerberger (stefan.steinerberger(AT)gmail.com) 
               and Emeric Deutsch (deutsch(AT)duke.poly.edu), Jul 22 2006

Search completed in 0.001 seconds