%I A005203 M1539
%S A005203 0,1,2,5,22,181,5814,1488565,12194330294,25573364166211253,
%T A005203 439347050970302571643057846,15829145720289447797800874537321282579904181,
%U A005203 9797766637414564027586288536574448245991597197836000123235901011048118
%N A005203 Fibonacci numbers (or rabbit sequence) converted to decimal.
%D A005203 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences,
Academic Press, 1995 (includes this sequence).
%D A005203 J. L. Davison, A series and its associated continued fraction, Proc.
Amer. Math. Soc., 63 (1977), 29-32.
%D A005203 H. W. Gould, J. B. Kim and V. E. Hoggatt, Jr., Sequences associated with
t-ary coding of Fibonacci's rabbits, Fib. Quart., 15 (1977), 311-318.
%H A005203 R. Knott, <a href="http://www.mcs.surrey.ac.uk/Personal/R.Knott/Fibonacci/
fibrab.html">The Fibonacci Rabbit Sequence</a>
%H A005203 R. Knott, <a href="http://www.mcs.surrey.ac.uk/Personal/R.Knott/Fibonacci/
fibrep.html">Rabbit Sequence in Zeckendorf Expansion (A003714)</a>
%H A005203 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
RabbitSequence.html">Further Information</a>
%F A005203 a(0) = 0, a(1) = 1, a(n) = a(n-1)*(2^Fib(n-1))+a(n-2)
%F A005203 a(n) = rewrite_0to1_1to10_n_i_times(0, n) [ Each 0->1, 1->10 in binary
expansion ]
%p A005203 rewrite_0to1_1to10_n_i_times := proc(n,i) local z,j; z := n; j := i;
while(j > 0) do z := rewrite_0to1_1to10(z); j := j - 1; od; RETURN(z);
end;
%p A005203 rewrite_0to1_1to10 := proc(n) option remember; if(n < 2) then RETURN(n
+ 1); else RETURN(((2^(1+(n mod 2))) * rewrite_0to1_1to10(floor(n/
2))) + (n mod 2) + 1); fi; end;
%Y A005203 Cf. A000045, A048707, A003714, A048721, A048722, A048678, A048679, A048680,
A005205.
%Y A005203 Sequence in context: A001437 A067549 A042933 this_sequence A090450 A137099
A068413
%Y A005203 Adjacent sequences: A005200 A005201 A005202 this_sequence A005204 A005205
A005206
%K A005203 nonn
%O A005203 0,3
%A A005203 N. J. A. Sloane (njas(AT)research.att.com).
%E A005203 Comments and more terms from Antti Karttunen, 30.3.1999
|