|
%I #7 Feb 17 2017 14:51:56
%S 1,1,2,3,12,22,111,133,321,1231,2322,11323,22122,111222,211121,323113,
%T 1311311,3112131,12131212,22321113,112222332,212321222,332321331,
%U 1323113323,3133213131,12311111231,23221332132,113233221133,221232331112,1112313322322
%N a(n) = Fibonacci(n) represented in bijective base-3 numeration.
%H Alois P. Heinz, <a href="/A282234/b282234.txt">Table of n, a(n) for n = 1..1000</a>
%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Bijective_numeration">Bijective numeration</a>
%F a(n) = A007932(A000045(n)).
%p a:= proc(n) local b, d, l, m; l:= NULL;
%p b, m:= 3, combinat[fibonacci](n);
%p while m>0 do d:= irem(m, b, 'm');
%p if d=0 then d:=b; m:=m-1 fi;
%p l:= d, l
%p od; parse(cat(l))
%p end:
%p seq(a(n), n=0..35);
%Y Column k=3 of A214679.
%Y Cf. A000045, A007932.
%K nonn,base,easy
%O 1,3
%A _Alois P. Heinz_, Feb 09 2017
|
