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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A048644 Differences between partial sums of Gray code (A048641) and triangular numbers (A000217). 1
0, 0, 1, 0, 2, 4, 3, 0, 4, 8, 13, 16, 14, 12, 7, 0, 8, 16, 25, 32, 42, 52, 59, 64, 60, 56, 53, 48, 38, 28, 15, 0, 16, 32, 49, 64, 82, 100, 115, 128, 148, 168, 189, 208, 222, 236, 247, 256, 248, 240, 233, 224, 218, 212, 203, 192, 172, 152, 133, 112, 86, 60, 31, 0, 32, 64 (list; graph; refs; listen; history; internal format)
OFFSET

0,5

COMMENTS

a(2^n-1) = 0 for all n.

FORMULA

a(n) = sum(XORnos(j, floor(j/2)), j=0..n)-((n^2+n)/2).

CROSSREFS

Cf. A000217, A048461, A048643.

Sequence in context: A121819 A134138 A201911 * A106137 A127651 A019641

Adjacent sequences:  A048641 A048642 A048643 * A048645 A048646 A048647

KEYWORD

easy,nonn

AUTHOR

Antti Karttunen, Jul 14 1999

EXTENSIONS

Corrected by Don Reble (djr(AT)nk.ca), May 01 2006

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 17 11:46 EST 2012. Contains 206011 sequences.