

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)



OFFSET

1,1


LINKS

Table of n, a(n) for n=1..25.
Ian Stewart, Tales of a Neglected Number
Ian Stewart, Tales of a Neglected Number, Mathematical Recreations, Scientific American, Vol. 274, No. 6 (1996), pp. 102103.
E. Wilson, The Scales of Mt. Meru (1999)


CROSSREFS

Sequence in context: A296028 A165263 A108737 * A295891 A093879 A117872
Adjacent sequences: A165218 A165219 A165220 * A165222 A165223 A165224


KEYWORD

nonn


AUTHOR

John Lien, Sep 08 2009


STATUS

approved



