Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A061107
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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
5
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

Harry J. Smith, Table of n, a(n) for n=0,...,15

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

a(n)=A036299(n-1), n>0. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 02 2008]

EXAMPLE

a(1) = 0, a(2) = 1, a(3) = a(2)a(1)= 10, etc.

PROGRAM

(PARI) { default(realprecision, 100); L=log(10); for (n=0, 15, if (n>2, a=a1*10^(log(a2)\L + 1) + a2; a2=a1; a1=a, if (n==0, a=0, if (n==1, a=a2=1, a=a1=10))); write("b061107.txt", n, " ", a) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jul 18 2009]

CROSSREFS

Cf. A063896, A131242. See A005203 for the sequence version converted to decimal.

Sequence in context: A162849 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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 24 23:16 EST 2009. Contains 167481 sequences.


AT&T Labs Research