Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A050468
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A050468 Sum_{d|n, n/d=1 mod 4} d^4 - Sum_{d|n, n/d=3 mod 4} d^4. +0
5
1, 16, 80, 256, 626, 1280, 2400, 4096, 6481, 10016, 14640, 20480, 28562, 38400, 50080, 65536, 83522, 103696, 130320, 160256, 192000, 234240, 279840, 327680, 391251, 456992, 524960, 614400, 707282, 801280, 923520, 1048576, 1171200 (list; graph; listen)
OFFSET

1,2

COMMENT

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

Called E'_4(n) by Hardy.

REFERENCES

E. Grosswald, Representations of Integers as Sums of Squares. Springer-Verlag, NY, 1985, p. 120.

G. H. Hardy, Ramanujan: twelve lectures on subjects suggested by his life and work, Chelsea Publishing Company, New York 1959, p. 135 section 9.3. MR0106147 (21 #4881)

FORMULA

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

PROGRAM

(PARI) a(n)=if(n<1, 0, sumdiv(n, d, (n/d%2)*(-1)^((n/d-1)/2)*d^4)) /* Michael Somos Sep 12 2005 */

CROSSREFS

Cf. A050469, A050470, A050471.

Sequence in context: A111732 A008511 A130810 this_sequence A068778 A034570 A069840

Adjacent sequences: A050465 A050466 A050467 this_sequence A050469 A050470 A050471

KEYWORD

nonn,mult

AUTHOR

njas, 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 July 8 18:40 EDT 2008. Contains 141013 sequences.


AT&T Labs Research