cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A211779 a(n) = Sum_{d_A000203(x).

Original entry on oeis.org

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
Offset: 1

Views

Author

Jaroslav Krizek, Apr 20 2012

Keywords

Comments

The numbers n < 1000 such that n divides a(n) are 4, 10, 42, and 90. (See A224488).

Crossrefs

Programs

  • Mathematica
    Table[Sum[DivisorSigma[1, d], {d, Most[Divisors[n]]}], {n, 100}] (* T. D. Noe, Apr 26 2012 *)
  • PARI
    a(n)=sumdiv(n,d,sigma(d))-sigma(n) \\ Charles R Greathouse IV, Feb 19 2013

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
Sum_{k=1..n} a(k) ~ c * n^2, where c = Pi^4/72 - Pi^2/12 = 0.530437... . - Amiram Eldar, Mar 17 2024