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.

A258913 a(n) is the sum of all numbers k for which sigma(k) = n.

Original entry on oeis.org

1, 0, 2, 3, 0, 5, 4, 7, 0, 0, 0, 17, 9, 13, 8, 0, 0, 27, 0, 19, 0, 0, 0, 52, 0, 0, 0, 12, 0, 29, 41, 52, 0, 0, 0, 22, 0, 37, 18, 27, 0, 87, 0, 43, 0, 0, 0, 115, 0, 0, 0, 0, 0, 87, 0, 67, 49, 0, 0, 121, 0, 61, 32, 0, 0, 0, 0, 67, 0, 0, 0, 253, 0, 73, 0, 0, 0
Offset: 1

Views

Author

Jeppe Stig Nielsen, Jun 14 2015

Keywords

Comments

Here sigma is A000203, the sum-of-divisors function.
a(n) is the sum of the n-th row in A085790.
We can divide the set of natural numbers into three classes based on whether a(n)n. The last class is A258914. Are there any n in the second category, i.e., n such that a(n)=n, other than n=1 (see link)?
It is natural to further divide the class a(n)A007369 (not in image of sigma), which is all n for which A054973(n)=0. The second one of these, the case 01) all of A007370 (just one pre-image of n under sigma, equivalently A054973(n)=1), but also includes some terms that have more than one pre-image, see A258931.
If there exists a number n>1 such that a(n)=n, then n > 2.5*10^10. - Giovanni Resta, Jun 15 2015
Row sums of A299762. - Omar E. Pol, Mar 14 2018

Examples

			To find a(24), note that the only values of k with sigma(k)=24 are k=14,15,23; therefore a(24)=14+15+23=52.
		

Crossrefs

Programs

  • Mathematica
    a[n_] := Sum[k*Boole[DivisorSigma[1, k] == n], {k, 1, n}]; Array[a, 80] (* Jean-François Alcover, Jun 15 2015 *)
  • PARI
    a(n)=sum(k=1,n,if(sigma(k)==n,k))
    
  • PARI
    first(n)=my(v=vector(n),s); for(k=1,n,s=sigma(k);if(s<=n,v[s]+=k));v \\ Charles R Greathouse IV, Jun 15 2015
    
  • PARI
    a(n) = vecsum(invsigma(n)); \\ Amiram Eldar, Dec 16 2024, using Max Alekseyev's invphi.gp