The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A282239 a(n) = Fibonacci(n) represented in bijective base-8 numeration. 2

%I

%S 1,1,2,3,5,8,15,25,42,67,131,218,351,571,1142,1733,2875,4828,8125,

%T 15155,25282,42457,67761,132438,222421,354861,577482,1154563,1754265,

%U 3128848,4885335,8236385,15343742,25582347,43146311,68748658,134117171,224867851,361187242

%N a(n) = Fibonacci(n) represented in bijective base-8 numeration.

%H Alois P. Heinz, <a href="/A282239/b282239.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) = A214678(A000045(n)).

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

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

%Y Cf. A000045, A214678.

%K nonn,base,easy

%O 1,3

%A _Alois P. Heinz_, Feb 09 2017

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.

Last modified August 13 22:57 EDT 2020. Contains 336473 sequences. (Running on oeis4.)