

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



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
(list;
graph;
refs;
listen;
history;
text;
internal format)




