login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A282235 a(n) = Fibonacci(n) represented in bijective base-4 numeration. 2
1, 1, 2, 3, 11, 14, 31, 111, 142, 313, 1121, 1434, 3221, 11321, 21142, 33123, 114331, 214114, 341111, 1221231, 2222342, 3444233, 12333241, 22444134, 41443441, 131214241, 233324342, 431211243, 1331142311, 2422414214, 4414223131, 13443243411, 31124133142 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

LINKS

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

Wikipedia, Bijective numeration

FORMULA

a(n) = A084544(A000045(n)).

MAPLE

a:= proc(n) local b, d, l, m; l:= NULL;

      b, m:= 4, 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=4 of A214679.

Cf. A000045, A084544.

Sequence in context: A145771 A042473 A042665 * A242821 A182709 A321766

Adjacent sequences:  A282232 A282233 A282234 * A282236 A282237 A282238

KEYWORD

nonn,base,easy

AUTHOR

Alois P. Heinz, Feb 09 2017

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 18 04:50 EDT 2019. Contains 326072 sequences. (Running on oeis4.)