A165221 The Padovan sequence analog of the Fibonacci "rabbit" constant binary expansion. Starting with 0 and using the transitions 0->1,1->10,10->01 the subsequences 0,1,10,01,110,1001,01110,1101001,100101110,011101101001... are formed where each subsequence has P sub n ones and length P sub (n-1) binary digits, where P sub n is the n-th Padovan number. This sequence is the concatenation of all the subsequences. Also note that the n-th subsequence is the concatenation of the n-th-3 and n-th-2 subsequences.

0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1

Offset: 1

Author

John Lien, Sep 08 2009

Keywords

• nonn

Links

• Ian Stewart, Tales of a Neglected Number
• Ian Stewart, Tales of a Neglected Number, Mathematical Recreations, Scientific American, Vol. 274, No. 6 (1996), pp. 102-103.
• E. Wilson, The Scales of Mt. Meru (1999)