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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A071413 a(n) = if n=0 then 0 else a(floor(n/2))+n*(-1)^(n mod 2). 0
0, -1, 1, -4, 5, -4, 2, -11, 13, -4, 6, -15, 14, -11, 3, -26, 29, -4, 14, -23, 26, -15, 7, -38, 38, -11, 15, -38, 31, -26, 4, -57, 61, -4, 30, -39, 50, -23, 15, -62, 66, -15, 27, -58, 51, -38, 8, -85, 86, -11, 39, -62, 67, -38, 16, -93, 87, -26, 32, -85, 64, -57, 5 (list; graph; refs; listen; history; internal format)
OFFSET

0,4

LINKS

R. Stephan, Some divide-and-conquer sequences ...

R. Stephan, Table of generating functions

CROSSREFS

Cf. A005187.

Sequence in context: A120867 A011427 A175622 * A161811 A016717 A031349

Adjacent sequences:  A071410 A071411 A071412 * A071414 A071415 A071416

KEYWORD

sign

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jun 24 200o

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 00:47 EST 2012. Contains 205567 sequences.