The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A248003 a(n) = (sum of totatives of n ) / (2^(omega(n)-1)); a(n) = A023896(n) / A007875(n). 1
 1, 1, 3, 4, 10, 3, 21, 16, 27, 10, 55, 12, 78, 21, 30, 64, 136, 27, 171, 40, 63, 55, 253, 48, 250, 78, 243, 84, 406, 30, 465, 256, 165, 136, 210, 108, 666, 171, 234, 160, 820, 63, 903, 220, 270, 253, 1081, 192, 1029, 250, 408, 312, 1378, 243, 550, 336 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 LINKS G. C. Greubel, Table of n, a(n) for n = 1..5000 FORMULA a(n) = A023896(n)/A007875(n) = A023896(n)/2^(A001221(n)-1) = (n/2)*A000010(n)/2^(A001221(n)-1) = n*A023022(n)/A007875(n) = 2*A023896(n)/A034444(n) = n*A000010(n)/A034444(n) . a(n) is multiplicative with a(p^e) = (p-1)*p^(2e-1)/2. EXAMPLE For n=30; a(30) = A023896(30)/A007875(30) = 120/4 = 30. MATHEMATICA Join[{1}, Table[(n/2)*EulerPhi[n]*2^(1 - PrimeNu[n]), {n, 2, 50}]] (* G. C. Greubel, May 22 2017 *) PROG (MAGMA) [(n*EulerPhi(n)/2)/(2^((#(PrimeDivisors(n)))-1)): n in [1..100]] (PARI) concat([1], for(n=2, 50, print1((n/2)*eulerphi(n)*2^(1-omega(n)), ", "))) \\ G. C. Greubel, May 22 2017 CROSSREFS Cf. A023896, A007875, A001221, A000010, A023022, A034444. Sequence in context: A032477 A073015 A240546 * A063930 A183170 A014411 Adjacent sequences:  A248000 A248001 A248002 * A248004 A248005 A248006 KEYWORD nonn,mult AUTHOR Jaroslav Krizek, Sep 29 2014 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 10 04:38 EDT 2020. Contains 336368 sequences. (Running on oeis4.)