A282234 a(n) = Fibonacci(n) represented in bijective base-3 numeration.

1, 1, 2, 3, 12, 22, 111, 133, 321, 1231, 2322, 11323, 22122, 111222, 211121, 323113, 1311311, 3112131, 12131212, 22321113, 112222332, 212321222, 332321331, 1323113323, 3133213131, 12311111231, 23221332132, 113233221133, 221232331112, 1112313322322

Offset

1,3

Links

Alois P. Heinz, Table of n, a(n) for n = 1..1000

Wikipedia, Bijective numeration

Formula

a(n) = A007932(A000045(n)).

Maple

a:= proc(n) local b, d, l, m; l:= NULL;
      b, m:= 3, combinat[fibonacci](n);
      while m>0 do  d:= irem(m, b, 'm');
        if d=0 then d:=b; m:=m-1 fi;
        l:= d, l
      od; parse(cat(l))
    end:
seq(a(n), n=0..35);

Crossrefs

Column k=3 of A214679.

Cf. A000045, A007932.

Sequence in context: A077755 A061268 A122604 * A024780 A295366 A323120

Adjacent sequences: A282231 A282232 A282233 * A282235 A282236 A282237

Keyword

nonn,base,easy

Author

Alois P. Heinz, Feb 09 2017

Status

approved