This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A285895 Sum of divisors d of n such that n/d is not congruent to 0 mod 4. 5
 1, 3, 4, 6, 6, 12, 8, 12, 13, 18, 12, 24, 14, 24, 24, 24, 18, 39, 20, 36, 32, 36, 24, 48, 31, 42, 40, 48, 30, 72, 32, 48, 48, 54, 48, 78, 38, 60, 56, 72, 42, 96, 44, 72, 78, 72, 48, 96, 57, 93, 72, 84, 54, 120, 72, 96, 80, 90, 60, 144, 62, 96, 104, 96, 84, 144, 68 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Seiichi Manyama, Table of n, a(n) for n = 1..10000 EXAMPLE The divisors of 8 are 1, 2, 4, and 8. 8/1 == 0 (mod 4) and 8/2 == 0 (mod 4). Hence, a(8) = 4 + 8 = 12. PROG (PARI) a(n)=sumdiv(n, d, if(n/d%4, d, 0)); \\ Andrew Howroyd, Jul 20 2018 CROSSREFS Cf. A002131 (k=2), A078708 (k=3), this sequence (k=4), A285896 (k=5). Sequence in context: A158523 A001615 A133689 * A220345 A065967 A117986 Adjacent sequences:  A285892 A285893 A285894 * A285896 A285897 A285898 KEYWORD nonn,mult AUTHOR Seiichi Manyama, Apr 28 2017 EXTENSIONS Keyword:mult added by Andrew Howroyd, Jul 20 2018 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 February 16 09:23 EST 2019. Contains 320161 sequences. (Running on oeis4.)