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.

A085652 Fibonacci sequence in base 2 of the alternate number system.

This page as a plain text file.
%I A085652 #21 Feb 08 2017 20:20:33
%S A085652 1,1,2,11,21,112,221,1221,11122,22111,122121,1121112,2212121,12222121,
%T A085652 112211122,222122211,2111222221,12111122112,111112121221,212112212221,
%U A085652 1212122111122,11121211221111,21222222221121,122121211211112,1121121211121121,2212212111221121
%N A085652 Fibonacci sequence in base 2 of the alternate number system.
%D A085652 R. R. Forslund, A Logical Alternative to the existing positional number system. Souhtwest Journal of Pure and Applied Mathematics. Dec. 1995. Vol. 1
%H A085652 Alois P. Heinz, <a href="/A085652/b085652.txt">Table of n, a(n) for n = 1..1000</a>
%H A085652 R. R. Forslund, <a href="http://www.emis.de/journals/SWJPAM/Vol1_1995/rrf01.ps">A Logical Alternative to the Existing Positional Number System</a>
%H A085652 R. R. Forslund, <a href="http://my.tbaytel.net/forslund/rrf01.html">A Logical Alternative to the Existing Positional Number System</a>
%F A085652 a(n) = A007931(A000045(n)).
%p A085652 a:= proc(n) local d, l, m;
%p A085652       m:= combinat[fibonacci](n); l:= NULL;
%p A085652       while m>0 do d:= irem(m, 2, 'm');
%p A085652         if d=0 then d:=2; m:= m-1 fi;
%p A085652         l:= d, l
%p A085652       od; parse(cat(l))
%p A085652     end:
%p A085652 seq(a(n), n=1..30);  # _Alois P. Heinz_, Jul 25 2012
%Y A085652 Cf. A000045, A007931, A214679.
%K A085652 nonn,base,easy
%O A085652 1,3
%A A085652 Bob Forslund (forslund(AT)tbaytel.net), Jul 11 2003
%E A085652 More terms from _David Wasserman_, Feb 08 2005