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!)
 A211779 a(n) = Sum_{d_
 0, 1, 1, 4, 1, 8, 1, 11, 5, 10, 1, 27, 1, 12, 11, 26, 1, 33, 1, 35, 13, 16, 1, 70, 7, 18, 18, 43, 1, 68, 1, 57, 17, 22, 15, 107, 1, 24, 19, 92, 1, 84, 1, 59, 48, 28, 1, 161, 9, 59, 23, 67, 1, 112, 19, 114, 25, 34, 1, 217, 1, 36, 58, 120, 21, 116, 1, 83, 29 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 COMMENTS The numbers n < 1000 such that n divides a(n) are 4, 10, 42, and 90. (See A224488). LINKS Antti Karttunen, Table of n, a(n) for n = 1..27144 (first 1000 terms from Jaroslav Krizek) FORMULA a(n) = A007429(n) - A000203(n) = A211780(n) - A000203(n) + n. G.f.: sum(n>=1, A000203(n)*x^(2*n)/(1-x^n) ). - Mircea Merca, Feb 26 2014 a(n) = Sum_{d|n} A001065(d). - Antti Karttunen, Nov 13 2017 MAPLE with(numtheory); A211779:= proc(q) local b, d, j, n; for n from 1 to q do   b:=divisors(n); d:=add(sigma(b[j]), j=1..nops(b))-sigma(n);   if trunc(d)=d then print(d); fi; od; end: A211779(10000); # Paolo P. Lava, Feb 01 2013 MATHEMATICA Table[Sum[DivisorSigma[1, d], {d, Most[Divisors[n]]}], {n, 100}] (* T. D. Noe, Apr 26 2012 *) PROG (PARI) a(n)=sumdiv(n, d, sigma(d))-sigma(n) \\ Charles R Greathouse IV, Feb 19 2013 CROSSREFS Cf. A000203, A007429, A001065, A211780, A224488. Sequence in context: A240776 A019768 A319296 * A318445 A158496 A265722 Adjacent sequences:  A211776 A211777 A211778 * A211780 A211781 A211782 KEYWORD nonn AUTHOR Jaroslav Krizek, Apr 20 2012 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 May 18 16:07 EDT 2021. Contains 343995 sequences. (Running on oeis4.)