This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A282240 #13 Jul 24 2024 08:14:24 %S A282240 1,1,2,3,5,8,14,23,37,61,98,169,278,458,747,1316,2164,3481,5655,9246, %T A282240 15912,26258,43271,69539,123821,194461,328382,533853,863345,1497298, %U A282240 2471654,3978963,6561727,11651791,18323628,29975529,49399258,81485788,141896157 %N A282240 a(n) = Fibonacci(n) represented in bijective base-9 numeration. %H A282240 Alois P. Heinz, <a href="/A282240/b282240.txt">Table of n, a(n) for n = 1..4567</a> %H A282240 Wikipedia, <a href="https://en.wikipedia.org/wiki/Bijective_numeration">Bijective numeration</a> %F A282240 a(n) = A052382(A000045(n)). %e A282240 a(10) = 61_bij9 = 9*6+1 = 55 = Fibonacci(10). %p A282240 a:= proc(n) local b, d, l, m; l:= NULL; %p A282240 b, m:= 9, combinat[fibonacci](n); %p A282240 while m>0 do d:= irem(m, b, 'm'); %p A282240 if d=0 then d:=b; m:=m-1 fi; %p A282240 l:= d, l %p A282240 od; parse(cat(l)) %p A282240 end: %p A282240 seq(a(n), n=0..40); %Y A282240 Column k=9 of A214679. %Y A282240 Cf. A000045, A052382. %K A282240 nonn,base,easy %O A282240 1,3 %A A282240 _Alois P. Heinz_, Feb 09 2017