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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A135872 Multiply the positive integers which are coprime to n in order (starting at 1). a(n) is the smallest such partial product that is >= n. 1

%I #9 Sep 16 2015 13:29:12

%S 1,3,8,15,6,35,24,15,40,21,24,35,24,15,56,105,24,35,24,21,40,105,24,

%T 35,144,105,40,135,120,77,120,105,40,105,144,385,120,105,40,189,120,

%U 55,120,105,56,105,120,385,120,189,280,105,120,385,144,135,280,105,120

%N Multiply the positive integers which are coprime to n in order (starting at 1). a(n) is the smallest such partial product that is >= n.

%e The positive integers which are coprime to 9 begin: 1,2,4,5,7,8,10,11,... Checking the partial products: 1=1, 1*2=2, 1*2*4 = 8, 1*2*4*5 =40,... 40 is the smallest such partial product which is >= 9. So a(9) = 40.

%t a = {}; For[n = 1, n < 60, n++, p = 1; i = 1; While[p < n, i++; If[GCD[i, n] == 1, p = p*i]]; AppendTo[a, p]]; a (* _Stefan Steinerberger_, Feb 06 2008 *)

%Y Cf. A135873.

%K nonn

%O 1,2

%A _Leroy Quet_, Dec 03 2007

%E More terms from _Stefan Steinerberger_, Feb 06 2008

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 22:17 EDT 2024. Contains 371964 sequences. (Running on oeis4.)