A282235 a(n) = Fibonacci(n) represented in bijective base-4 numeration.
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
Offset: 1
Links
- Alois P. Heinz, Table of n, a(n) for n = 1..1000
- Wikipedia, Bijective numeration
Programs
-
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);