|
%I #10 Feb 10 2020 22:41:12
%S 1,1,2,3,5,8,14,23,37,61,98,169,278,458,747,1316,2164,3481,5655,9246,
%T 15912,26258,43271,69539,123821,194461,328382,533853,863345,1497298,
%U 2471654,3978963,6561727,11651791,18323628,29975529,49399258,81485788,141896157
%N a(n) = Fibonacci(n) represented in bijective base-9 numeration.
%H Alois P. Heinz, <a href="/A282240/b282240.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) = A052382(A000045(n)).
%e a(10) = 61_bij9 = 9*6+1 = 55 = Fibonacci(10).
%p a:= proc(n) local b, d, l, m; l:= NULL;
%p b, m:= 9, 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..40);
%Y Column k=9 of A214679.
%Y Cf. A000045, A052382.
%K nonn,base,easy
%O 1,3
%A _Alois P. Heinz_, Feb 09 2017
|
