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!)
 A193512 a(n) = Sum of odd divisors of Omega(n), a(1) = 0. 3
 0, 1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 4, 1, 1, 1, 1, 1, 4, 1, 4, 1, 1, 1, 1, 1, 1, 4, 4, 1, 4, 1, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4, 1, 4, 4, 1, 1, 6, 1, 4, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4, 4, 1, 4, 1, 4, 1, 4, 1, 6, 1, 1, 4, 4, 1, 4, 1, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 4, 1, 4, 4, 1, 1, 4, 1, 1, 4 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,8 COMMENTS Omega = A001222 is the number of prime divisors of the argument, counted with multiplicity. a(1) = 0 by convention. LINKS Antti Karttunen, Table of n, a(n) for n = 1..10000 FORMULA a(1) = 0, for n > 1, a(n) = A000593(A001222(n)). a(n) + A193511(n) = A290080(n). - Antti Karttunen, Jul 23 2017 EXAMPLE a(8) = 4 because Omega(8) = 3 and the sum of the 2 odd divisors {1, 3} is 4. MATHEMATICA Table[Total[Select[Divisors[PrimeOmega[n]], OddQ[ # ]&]], {n, 58}] PROG (PARI) A000593(n) = sigma(n>>valuation(n, 2)); \\ This function from Charles R Greathouse IV, Sep 09 2014 A193512(n) = if(1==n, 0, A000593(bigomega(n))); \\ Antti Karttunen, Jul 23 2017 CROSSREFS Cf. A000593, A001222, A193509, A193511, A290080. Sequence in context: A332847 A245501 A247026 * A276330 A234957 A327939 Adjacent sequences:  A193509 A193510 A193511 * A193513 A193514 A193515 KEYWORD nonn AUTHOR Michel Lagneau, Jul 29 2011 EXTENSIONS Description clarified, more terms from Antti Karttunen, Jul 23 2017 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 April 17 08:40 EDT 2021. Contains 343064 sequences. (Running on oeis4.)