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!)
A189914 a(n) is 2^phi(n) times the least common multiple of the proper divisors of n. 1

%I #22 Sep 30 2017 05:45:59

%S 1,2,2,4,8,16,24,64,64,192,160,1024,192,4096,896,3840,2048,65536,1152,

%T 262144,5120,86016,22528,4194304,6144,5242880,106496,2359296,114688,

%U 268435456,7680,1073741824,1048576,34603008,2228224,587202560,147456,68719476736,9961472

%N a(n) is 2^phi(n) times the least common multiple of the proper divisors of n.

%C The sequence relates arithmetic properties of roots of unity in the complex plane with number theoretic properties of integers. This connection often appears as intriguing identities showing products of specific values of the sine function or the gamma function reducing to simple values (see for instance the first formula below).

%H Charles R Greathouse IV, <a href="/A189914/b189914.txt">Table of n, a(n) for n = 0..3322</a>

%H Peter Luschny and Stefan Wehmeier, <a href="http://arxiv.org/abs/0909.1838">The lcm(1,2,...,n) as a product of sine values sampled over the points in Farey sequences</a>, arXiv:0909.1838 [math.CA], Sep 2009.

%H Albert Nijenhuis, <a href="http://www.jstor.org/stable/10.4169/000298910x515802">Short Gamma Products with Simple Values</a>, The American Mathematical Monthly, Vol. 117, No. 8, Oct 2010, pp. 733-737.

%H J. Sándor and L. Tóth, <a href="http://gdz.sub.uni-goettingen.de/dms/load/img/?PID=GDZPPN002082217">A remark on the gamma function</a>, Elemente der Mathematik, 44 (1989), pp. 73-76, Birkhäuser.

%F Let R(n) = {k | gcd(n,k) = 1, k = 1..floor(n/2)} and b(n) = product_{R(n)} sin(Pi*k/n) then a(n) = n / b(n)^2 for n > 1.

%F a(n) = A066781(n)*A048671(n).

%p A189914 := n -> 2^numtheory[phi](n)*ilcm(op(numtheory[divisors](n) minus {1,n})): seq(A189914(n), n=0..35);

%t a[n_] := 2^EulerPhi[n] * LCM @@ Most[Divisors[n]]; a[0] = 1; a[1] = 2; Table[a[n], {n, 0, 38}] (* _Jean-François Alcover_, Jan 22 2014 *)

%o (PARI) a(n)=if(n,my(p=n); if(isprime(n)||(ispower(n, , &p)&&isprime(p)), n/p, n)<<eulerphi(n),1) \\ _Charles R Greathouse IV_, Jun 24 2011

%K nonn

%O 0,2

%A _Peter Luschny_, Jun 22 2011

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 04:14 EDT 2024. Contains 371918 sequences. (Running on oeis4.)