|
| |
|
|
A060866
|
|
Sum of (d+d') over all unordered pairs (d,d') with d*d' = n.
|
|
4
| |
|
|
2, 3, 4, 9, 6, 12, 8, 15, 16, 18, 12, 28, 14, 24, 24, 35, 18, 39, 20, 42, 32, 36, 24, 60, 36, 42, 40, 56, 30, 72, 32, 63, 48, 54, 48, 97, 38, 60, 56, 90, 42, 96, 44, 84, 78, 72, 48, 124, 64, 93, 72, 98, 54, 120, 72, 120, 80, 90, 60, 168, 62, 96, 104, 135, 84, 144, 68, 126, 96
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| Paraphrasing the Jovovic formula: if n is not a square then a(n) = sigma(n), the sum of divisors of n, otherwise a(n) = sigma(n) + sqrt(n). [From Omar E. Pol (info(AT)polprimos.com), Jun 23 2009]
|
|
|
FORMULA
| a(n) = A066839(n)+A070038(n) = A000203(n)+A037213(n). G.f.: Sum_{n>0} n*x^n*(x^(n*(n-1))-x^(n^2)+1)/(1-x^n). - Vladeta Jovovic (vladeta(AT)eunet.rs), Jan 25 2003
|
|
|
EXAMPLE
| a(4)=9 because pairs of factors are 1*4 and 2*2 and 1+4+2+2=9. a(6)=12 because pairs of factors are 1*6 and 2*3 and 1+6+2+3=12.
|
|
|
MAPLE
| A060866 := proc(n)
numtheory[sigma](n) ;
if issqr(n) then
%+sqrt(n) ;
else
% ;
end if;
end proc: # R. J. Mathar, Oct 24 2011
|
|
|
CROSSREFS
| Cf. A060872.
Sequence in context: A106443 A091205 A106447 * A064478 A111798 A115305
Adjacent sequences: A060863 A060864 A060865 * A060867 A060868 A060869
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| Jason Earls (zevi_35711(AT)yahoo.com), May 04 2001
|
|
|
EXTENSIONS
| More terms from Erich Friedman (efriedma(AT)stetson.edu), Jun 03 2001
|
| |
|
|
