Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A050469
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A050469 Sum_{ d divides n, n/d=1 mod 4} d - Sum_{ d divides n, n/d=3 mod 4} d. +0
4
1, 2, 2, 4, 6, 4, 6, 8, 7, 12, 10, 8, 14, 12, 12, 16, 18, 14, 18, 24, 12, 20, 22, 16, 31, 28, 20, 24, 30, 24, 30, 32, 20, 36, 36, 28, 38, 36, 28, 48, 42, 24, 42, 40, 42, 44, 46, 32, 43, 62, 36, 56, 54, 40, 60, 48, 36, 60, 58, 48, 62, 60, 42, 64, 84, 40 (list; graph; listen)
OFFSET

1,2

COMMENT

Multiplicative with a(p^e)=p^e if p=2, (p^(e+1)-1)/(p-1) if p==1 (mod 4), else (p^(e+1)+(-1)^e)/(p+1). - Michael Somos May 02 2005

Multiplicative because it is the Dirichlet convolution of A000027 = n and A101455 = [1 0 -1 0 1 0 -1 ...], which are both multiplicative. Christian G. Bower (bowerc(AT)usa.net) May 17, 2005.

FORMULA

G.f.: Sum_{n>=1} n*x^n/(1+x^(2*n)). - Vladeta Jovovic (vladeta(AT)eunet.rs), Oct 16 2002

PROGRAM

(PARI) a(n)=if(n<1, 0, sumdiv(n, d, d*((n/d%4==1)-(n/d%4==3))))

(PARI) {a(n)=local(A, p, e); if(n<2, n==1, A=factor(n); prod(k=1, matsize(A)[1], if(p=A[k, 1], e=A[k, 2]; if(p==2, p^e, if(p%4==1, (p^(e+1)-1)/(p-1), (p^(e+1)+(-1)^e)/(p+1)))))) } /* Michael Somos May 02 2005 */

(PARI) a(n)=if(n<1, 0, polcoeff(sum(k=1, n, k*x^k/(1+x^(2*k)), x*O(x^n)), n))

CROSSREFS

Cf. A050470, A050471, A050468.

Sequence in context: A051495 A073256 A166362 this_sequence A085730 A089002 A097089

Adjacent sequences: A050466 A050467 A050468 this_sequence A050470 A050471 A050472

KEYWORD

nonn,mult

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Dec 23 1999

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research