login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A325055 a(0) = 0, a(1) = 1; a(2*n) = a(n-1) + a(n), a(2*n+1) = a(n+1) - a(n). 1
0, 1, 1, 0, 2, -1, 1, 2, 2, -3, 1, 2, 0, 1, 3, 0, 4, -5, -1, 4, -2, 1, 3, -2, 2, 1, 1, 2, 4, -3, 3, 4, 4, -9, -1, 4, -6, 5, 3, -6, 2, 3, -1, 2, 4, -5, 1, 4, 0, -1, 3, 0, 2, 1, 3, 2, 6, -7, 1, 6, 0, 1, 7, 0, 8, -13, -5, 8, -10, 5, 3, -10, -2, 11, -1, -2 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,5
LINKS
FORMULA
a(n) = Sum_{k=1..n} a(2*k-1) = Sum_{k=1..n} (-1)^(n-k) * a(2*k).
a(2^k) = 2^floor(k/2).
MATHEMATICA
a[0] = 0; a[1] = 1; a[n_] := a[n] = If[EvenQ[n], a[(n - 2)/2] + a[n/2], a[(n + 1)/2] - a[(n - 1)/2]]; Table[a[n], {n, 0, 75}]
CROSSREFS
Cf. A001196 (positions of 0's), A002487, A005590, A075825.
Sequence in context: A050167 A047050 A205028 * A325526 A057820 A054012
KEYWORD
sign
AUTHOR
Ilya Gutkovskiy, Sep 04 2019
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 01:35 EDT 2024. Contains 371964 sequences. (Running on oeis4.)