

A165263


A sequence similar to the Fibonacci rabbit sequence for the Padovan sequence


0



0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,1


COMMENTS

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 nth subsequence has a 1 count equal to P(n) where P is the nth 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.


LINKS

Table of n, a(n) for n=1..19.


CROSSREFS

Sequence in context: A189132 A189203 A296028 * A108737 A165221 A295891
Adjacent sequences: A165260 A165261 A165262 * A165264 A165265 A165266


KEYWORD

nonn


AUTHOR

John Lien, Sep 12 2009


STATUS

approved



