|
%I #13 Apr 01 2022 11:39:22
%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 (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.
%H Ian Stewart, <a href="http://web.archive.org/web/20120330094207/http://www.fortunecity.com/emachines/e11/86/padovan.html">Tales of a Neglected Number</a>
%H Ian Stewart, <a href="https://www.jstor.org/stable/24989576">Tales of a Neglected Number</a>, Mathematical Recreations, Scientific American, Vol. 274, No. 6 (1996), pp. 102-103.
%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
|
