|
%I #3 Jun 11 2015 11:25:48
%S 0,1,0,1,1,0,0,1,1,0,1,0,0,1,0,1,1,1,0
%N A sequence similar to the Fibonacci rabbit sequence for the Padovan sequence
%C Starting with 0,1 and using the maps 0->1 1->.10 and 10->01 Gives the subsequences 0,1,10,01,1.10,10.01,01.1.10,1.10.10.01 etc. The n-th subsequence has a 1 count equal to P(n) where P is the n-th Padovan sequence number (A000931) and a digit length P(n+2). This sequence represents the binary number formed by concatenating these sebsequences. Similar to how the Fibonacci rabbit constant is formed by the maps 0->1 1->10.
%K nonn
%O 1,1
%A _John Lien_, Sep 12 2009
|
