OFFSET
1,3
COMMENTS
Not all values arise and some arise more than once.
Row sums of triangle A134866. - Gary W. Adamson, Nov 14 2007
Sum of the largest parts of the partitions of n into two parts such that the smaller part divides the larger. - Wesley Ivan Hurt, Dec 21 2017
a(n) is also the sum of all parts minus the total number of parts of all partitions of n into equal parts (an interpretation of the Torlach Rush's formula). - Omar E. Pol, Nov 30 2019
If and only if sigma(n) divides a(n), then n is one of Ore's Harmonic numbers, A001599. - Antti Karttunen, Jul 18 2020
REFERENCES
P. A. MacMahon, Combinatory Analysis, Cambridge Univ. Press, London and New York, Vol. 1, 1915 and Vol. 2, 1916; see vol. 2, p 30.
LINKS
T. D. Noe, Table of n, a(n) for n = 1..10000
FORMULA
If p is prime, then a(p) = p*tau(p)-sigma(p) = 2p-(p+1) = p-1 = phi(p).
If n>1, then a(n)>0.
a(n) = Sum_{d|n} (n-d). - Amarnath Murthy, Jul 31 2005
G.f.: Sum_{k>=1} k*x^(2*k)/(1 - x^k)^2. - Ilya Gutkovskiy, Oct 24 2018
EXAMPLE
q^2 + 2*q^3 + 5*q^4 + 4*q^5 + 12*q^6 + 6*q^7 + 17*q^8 + 14*q^9 + ...
For n = 4 the partitions of 4 into equal parts are [4], [2,2], [1,1,1,1]. The sum of all parts is 4 + 2 + 2 + 1 + 1 + 1 + 1 = 12. There are 7 parts, so a(4) = 12 - 7 = 5. - Omar E. Pol, Nov 30 2019
MAPLE
with(numtheory); A094471:=n->n*tau(n)-sigma(n); seq(A094471(k), k=1..100); # Wesley Ivan Hurt, Oct 27 2013
divides := (k, n) -> k = n or (k > 0 and irem(n, k) = 0):
a := n -> local k; add(`if`(divides(n - k, n), k, 0), k = 0..n):
seq(a(n), n = 1..61); # Peter Luschny, Nov 14 2023
MATHEMATICA
Table[n*DivisorSigma[0, n] - DivisorSigma[1, n], {n, 1, 100}]
PROG
(PARI) {a(n) = n*numdiv(n) - sigma(n)} /* Michael Somos, Jan 25 2008 */
(SageMath)
def A094471(n): return sum(k for k in (0..n) if (n-k).divides(n))
print([A094471(n) for n in range(1, 62)]) # Peter Luschny, Nov 14 2023
(Julia)
using AbstractAlgebra
function A094471(n)
sum(k for k in 0:n if is_divisible_by(n, n - k))
end
[A094471(n) for n in 1:61] |> println # Peter Luschny, Nov 14 2023
(Python)
from math import prod
from sympy import factorint
def A094471(n):
f = factorint(n).items()
return n*prod(e+1 for p, e in f)-prod((p**(e+1)-1)//(p-1) for p, e in f)
# Chai Wah Wu, Nov 14 2023
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Labos Elemer, May 28 2004
EXTENSIONS
Simpler name by Peter Luschny, Nov 14 2023
STATUS
approved