A318922 Apply Lenormand's transformation k -> A318921(k) to the Fibonacci numbers.

0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 7, 2, 0, 6, 14, 4, 31, 39, 4, 0, 11, 8, 7, 1020, 32, 0, 228, 1016, 109, 249, 160, 7, 112, 3708, 3099, 340, 13208, 12526, 192, 3596, 8957, 999, 4178060, 746, 879, 13296, 15855, 16920, 29184, 227952, 124264, 16192, 984121, 77442, 1952, 16359, 4967, 1044

Offset: 0

Author

N. J. A. Sloane, Sep 08 2018

Keywords

• nonn
• base

Links

• Alois P. Heinz, Table of n, a(n) for n = 0..9396

Crossrefs

Cf. A000045, A318921.

Programs

Maple

a:= proc(n) local d, i, l, m, r;
      i, r, l, m:= 0$2, 2, (<<0|1>, <1|1>>^n)[1, 2];
      while m>0 do d:= irem(m, 2, 'm');
        if d=l then r:= r+d*2^i; i:=i+1 fi; l:= d
      od; r
    end:
seq(a(n), n=0..100);  # Alois P. Heinz, Sep 08 2018