|
Search: id:A005205
|
|
|
| A005205 |
|
Coding Fibonacci numbers. (Formerly M2877)
|
|
+0 4
|
|
| 1, 3, 10, 93, 2521, 612696, 4019900977, 6409020585966267, 67040619014505181883304178, 1118048584563024433220786501983631190591549, 195042693446883195450571898296824337898272003171567594807867055549521
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Binary Fibonacci (or rabbit) sequence A036299, read in base 3, then converted to decimal. - Jonathan Vos Post (jvospost2(AT)yahoo.com), Oct 19 2007
|
|
REFERENCES
|
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.
|
|
EXAMPLE
|
a(0) = 1 because A036299(0) = "1" and 1 base 3 = 1 base 10.
a(1) = 3 because A036299(1) = "10" and 10 base 3 = 3 base 10.
a(2) = 10 because A036299(2) = "101" and 101 base 3 = 10 base 10.
a(3) = 93 because A036299(3) = "10110" and 10110 base 3 = 93 base 10.
a(4) = 2521 because A036299(4) = "10110101" and 10110101 base 3 = 2521 base 10.
a(5) = 612696 because A036299(5) = "1011010110110" and 1011010110110 base 3 = 612696 base 10.
|
|
MAPLE
|
b:= proc(n) option remember; if n=0 then [0, 0] elif n=1 then [1, 1] else [b(n-1)[1] *3^b(n-1)[2] +b(n-2)[1], b(n-1)[2] +b(n-2)[2]] fi end: a:= n-> b(n)[1]: seq (a(n), n=1..11); [From Alois P. Heinz (heinz(AT)hs-heilbronn.de), Sep 17 2008]
|
|
CROSSREFS
|
Cf. A005205, A036299.
Adjacent sequences: A005202 A005203 A005204 this_sequence A005206 A005207 A005208
Sequence in context: A034792 A135457 A073733 this_sequence A065924 A013233 A013226
|
|
KEYWORD
|
nonn,new
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
More terms from Jonathan Vos Post (jvospost2(AT)yahoo.com), Oct 19 2007
Corrected (a(4) was missing) and extended by Alois P. Heinz (heinz(AT)hs-heilbronn.de), Sep 17 2008
|
|
|
Search completed in 0.002 seconds
|