cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A318703 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 imaginary part of f(n).

Original entry on oeis.org

0, 0, 1, 1, 0, 0, 1, 1, -2, -2, -1, -1, -2, -2, -1, -1, 0, 0, 1, 1, 0, 0, 1, 1, -2, -2, -1, -1, -2, -2, -1, -1, 4, 4, 5, 5, 4, 4, 5, 5, 2, 2, 3, 3, 2, 2, 3, 3, 4, 4, 5, 5, 4, 4, 5, 5, 2, 2, 3, 3, 2, 2, 3, 3, 0, 0, 1, 1, 0, 0, 1, 1, -2, -2, -1, -1, -2, -2, -1
Offset: 0

Views

Author

Rémy Sigrist, Sep 01 2018

Keywords

Comments

See A318702 for the real part of f and additional comments.

Crossrefs

Programs

  • Mathematica
    Array[Im[Total@ MapIndexed[#1*I^(First@ #2 - 1)*2^Floor[(First@ #2 - 1)/2] &, Reverse@ IntegerDigits[#, 2]]] &, 75, 0] (* Michael De Vlieger, Sep 02 2018 *)
  • PARI
    a(n) = my (b=Vecrev(binary(n))); imag(sum(k=1, #b, b[k] * I^(k-1) * 2^floor((k-1)/2)))

Formula

a(n) = A053985(A059906(n)).
a(2*n) = a(2*n + 1) for any n >= 0.
a(4 * k) = -2 * a(k) for any k >= 0.