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 (n1) binary digits, where P sub n is the nth Padovan number. This sequence is the concatenation of all the subsequences. Also note that the nth subsequence is the concatenation of the nth3 and nth2 subsequences.


0


%I
%S 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
%N 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 (n1) binary digits, where P sub n is the nth Padovan number. This sequence is the concatenation of all the subsequences. Also note that the nth subsequence is the concatenation of the nth3 and nth2 subsequences.
%H I. Stewart, <a href="http://www.fortunecity.com/emachines/e11/86/padovan.html">Tales of a Neglected Number</a>
%H E. Wilson, <a href="http://www.anaphoria.com/meruone.PDF">The Scales of Mt. Meru</a> (1999)
%K nonn
%O 1,1
%A _John Lien_, Sep 08 2009
