login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A318702
For any n >= 0 with binary expansion Sum_{k=0..w} b_k * 2^k, let f(n) = Sum_{k=0..w} b_k * i^k * 2^floor(k/2) (where i denotes the imaginary unit); a(n) is the real part of f(n).
3
0, 1, 0, 1, -2, -1, -2, -1, 0, 1, 0, 1, -2, -1, -2, -1, 4, 5, 4, 5, 2, 3, 2, 3, 4, 5, 4, 5, 2, 3, 2, 3, 0, 1, 0, 1, -2, -1, -2, -1, 0, 1, 0, 1, -2, -1, -2, -1, 4, 5, 4, 5, 2, 3, 2, 3, 4, 5, 4, 5, 2, 3, 2, 3, -8, -7, -8, -7, -10, -9, -10, -9, -8, -7, -8, -7
OFFSET
0,5
COMMENTS
See A318703 for the imaginary part of f.
See A318704 for the square of the modulus of f.
The function f defines a bijection from the nonnegative integers to the Gaussian integers.
This sequence has similarities with A316657.
FORMULA
a(n) = A053985(A059905(n)).
a(4 * k) = -2 * a(k) for any k >= 0.
MATHEMATICA
Array[Re[Total@ MapIndexed[#1*I^(First@ #2 - 1)*2^Floor[(First@ #2 - 1)/2] &, Reverse@ IntegerDigits[#, 2]]] &, 76, 0] (* Michael De Vlieger, Sep 02 2018 *)
PROG
(PARI) a(n) = my (b=Vecrev(binary(n))); real(sum(k=1, #b, b[k] * I^(k-1) * 2^floor((k-1)/2)))
CROSSREFS
KEYWORD
sign,base
AUTHOR
Rémy Sigrist, Sep 01 2018
STATUS
approved