login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 sub sequences 0,1,10,01,110,1001,01110,1101001,100101110,011101101001... are formed where each sub sequence 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 sub sequences. Also note that the n-th sub sequence is the concatenation of the n-th-3 and n-th-2 sub sequences. 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.

I. Stewart, Tales of a Neglected Number

E. Wilson, The Scales of Mt. Meru (1999)

CROSSREFS

Sequence in context: A118006 A165263 A108737 * A093879 A117872 A089809

Adjacent sequences:  A165218 A165219 A165220 * A165222 A165223 A165224

KEYWORD

nonn

AUTHOR

John Lien, Sep 08 2009

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified March 25 06:41 EDT 2017. Contains 284047 sequences.