Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A095792
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A095792 Z(n)-L(n), where Z=A095790 and L=A095791 are lengths of Zeckendorf and lazy Fibonacci representations in binary notation. +0
3
0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 (list; graph; listen)
OFFSET

0,1

FORMULA

a(n)=0 if n is of the form F(k)-1 for k>=1 and a(n)=1 otherwise.

EXAMPLE

Zeckendorf-binary of 11 is 10100; lazy-Fibonacci-binary of 11 is 1111.

Thus Z(11)=5, L(11)=4 and a(11)=5-4=1.

CROSSREFS

Cf. A000045, A072649, A095791.

Sequence in context: A099618 A106002 A066247 this_sequence A093385 A135136 A137331

Adjacent sequences: A095789 A095790 A095791 this_sequence A095793 A095794 A095795

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu), Jun 05 2004

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research