login
This site is supported by donations to The OEIS Foundation.

 

Logo

"Email this user" was broken Aug 14 to 9am Aug 16. If you sent someone a message in this period, please send it again.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A282239 a(n) = Fibonacci(n) represented in bijective base-8 numeration. 2
1, 1, 2, 3, 5, 8, 15, 25, 42, 67, 131, 218, 351, 571, 1142, 1733, 2875, 4828, 8125, 15155, 25282, 42457, 67761, 132438, 222421, 354861, 577482, 1154563, 1754265, 3128848, 4885335, 8236385, 15343742, 25582347, 43146311, 68748658, 134117171, 224867851, 361187242 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

LINKS

Alois P. Heinz, Table of n, a(n) for n = 1..1000

Wikipedia, Bijective numeration

FORMULA

a(n) = A214678(A000045(n)).

MAPLE

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

      b, m:= 8, 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..40);

CROSSREFS

Column k=8 of A214679.

Cf. A000045, A214678.

Sequence in context: A066372 A058519 A181065 * A191792 A151518 A082095

Adjacent sequences:  A282236 A282237 A282238 * A282240 A282241 A282242

KEYWORD

nonn,base,easy

AUTHOR

Alois P. Heinz, Feb 09 2017

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified August 17 23:58 EDT 2017. Contains 290682 sequences.