login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A076577 Sum of squares of divisors d of n such that n/d is odd. 2
1, 4, 10, 16, 26, 40, 50, 64, 91, 104, 122, 160, 170, 200, 260, 256, 290, 364, 362, 416, 500, 488, 530, 640, 651, 680, 820, 800, 842, 1040, 962, 1024, 1220, 1160, 1300, 1456, 1370, 1448, 1700, 1664, 1682, 2000, 1850, 1952, 2366, 2120, 2210, 2560, 2451, 2604 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

FORMULA

G.f.: Sum_{m>0} m^2*x^m/(1-x^(2*m)). More generally, if b(n, k) is sum of k-th powers of divisors d of n such that n/d is odd then b(2n, k) = sigma_k(2n)-sigma_k(n), b(2n+1, k) =sigma_k(2n+1), where sigma_k(n) is sum of k-th powers of divisors of n. G.f. for b(n, k): Sum_{m>0} m^k*x^m/(1-x^(2*m)).

b(n, k) is multiplicative: b(2^e, k) = 2^(k*e), b(p^e, k) = (p^(ke+k)-1)/(p^k-1) for an odd prime p.

a(2*n) = sigma_2(2*n)-sigma_2(n), a(2*n+1) = sigma_2(2*n+1), where sigma_2(n) is sum of squares of divisors of n (cf. A001157).

b(n, k) = (sigma_k(2n)-sigma_k(n))/2^k. - Vladeta Jovovic (vladeta(AT)eunet.rs), Oct 06 2003

CROSSREFS

Cf. A001227, A002131, A001157, A050999.

Sequence in context: A054901 A019574 A095273 * A008148 A089340 A175703

Adjacent sequences:  A076574 A076575 A076576 * A076578 A076579 A076580

KEYWORD

mult,nonn

AUTHOR

Vladeta Jovovic (vladeta(AT)eunet.rs), Oct 19 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 22:46 EST 2012. Contains 205681 sequences.