cp's OEIS Frontend

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.

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

This page as a plain text file.
%I A282239 #6 Feb 17 2017 14:54:32
%S A282239 1,1,2,3,5,8,15,25,42,67,131,218,351,571,1142,1733,2875,4828,8125,
%T A282239 15155,25282,42457,67761,132438,222421,354861,577482,1154563,1754265,
%U A282239 3128848,4885335,8236385,15343742,25582347,43146311,68748658,134117171,224867851,361187242
%N A282239 a(n) = Fibonacci(n) represented in bijective base-8 numeration.
%H A282239 Alois P. Heinz, <a href="/A282239/b282239.txt">Table of n, a(n) for n = 1..1000</a>
%H A282239 Wikipedia, <a href="https://en.wikipedia.org/wiki/Bijective_numeration">Bijective numeration</a>
%F A282239 a(n) = A214678(A000045(n)).
%p A282239 a:= proc(n) local b, d, l, m; l:= NULL;
%p A282239       b, m:= 8, combinat[fibonacci](n);
%p A282239       while m>0 do  d:= irem(m, b, 'm');
%p A282239         if d=0 then d:=b; m:=m-1 fi;
%p A282239         l:= d, l
%p A282239       od; parse(cat(l))
%p A282239     end:
%p A282239 seq(a(n), n=0..40);
%Y A282239 Column k=8 of A214679.
%Y A282239 Cf. A000045, A214678.
%K A282239 nonn,base,easy
%O A282239 1,3
%A A282239 _Alois P. Heinz_, Feb 09 2017