A282240 a(n) = Fibonacci(n) represented in bijective base-9 numeration.

1, 1, 2, 3, 5, 8, 14, 23, 37, 61, 98, 169, 278, 458, 747, 1316, 2164, 3481, 5655, 9246, 15912, 26258, 43271, 69539, 123821, 194461, 328382, 533853, 863345, 1497298, 2471654, 3978963, 6561727, 11651791, 18323628, 29975529, 49399258, 81485788, 141896157

Offset

1,3

Links

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

Wikipedia, Bijective numeration

Formula

a(n) = A052382(A000045(n)).

Example

a(10) = 61_bij9 = 9*6+1 = 55 = Fibonacci(10).

Maple

a:= proc(n) local b, d, l, m; l:= NULL;
      b, m:= 9, 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..40);

Crossrefs

Column k=9 of A214679.

Cf. A000045, A052382.

Sequence in context: A131132 A293545 A306274 * A004692 A094926 A225391

Adjacent sequences: A282237 A282238 A282239 * A282241 A282242 A282243

Keyword

nonn,base,easy

Author

Alois P. Heinz, Feb 09 2017

Status

approved