|
Search: id:A061107
|
|
|
| A061107 |
|
In the Fibonacci rabbit problem we start with an immature pair 'I' which matures after one season to 'M'. This mature pair after one season stays alive and breeds a new immature pair and we get the following sequence I, MI, MIM, MIMMI, MIMMIMIM, MIMMIMIMMIMMI... if we replace 'I' by a '0' and 'M' by a '1' we get the required binary sequence. |
|
+0
3
|
|
| 0, 1, 10, 101, 10110, 10110101, 1011010110110, 101101011011010110101, 1011010110110101101011011010110110, 1011010110110101101011011010110110101101011011010110101
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
REFERENCES
|
Amarnath Murthy, Smarandache Reverse auto correlated sequences and some Fibonacci derived sequences, Smarandache Notions Journal Vol. 12, No. 1-2-3, Spring 2001.
Ian Stewart, The Magical Maze.
|
|
LINKS
|
M. L. Perez et al., eds., Smarandache Notions Journal
|
|
FORMULA
|
a(1) = 0, a(2) =1, a(n) =concatenation of a(n-1) and a(n-2).
a(n)=a(n-1)*2^floor(log_2(a(n-2))+1)+a(n-2), for n>2, a(2)=10 (base 2). - Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), Jun 26 2007
|
|
EXAMPLE
|
a(1) = 0, a(2) = 1, a(3) = a(2)a(1)= 10, etc.
|
|
CROSSREFS
|
Cf. A063896, A131242. See A005203 for the sequence version converted to decimal.
Sequence in context: A108892 A041182 A036299 this_sequence A015498 A039393 A053041
Adjacent sequences: A061104 A061105 A061106 this_sequence A061108 A061109 A061110
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Apr 20 2001
|
|
EXTENSIONS
|
More terms from Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), Jun 26 2007
|
|
|
Search completed in 0.002 seconds
|
