Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A136480
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A136480 Number of trailing equal digits in binary representation of n. +0
3
1, 1, 1, 2, 2, 1, 1, 3, 3, 1, 1, 2, 2, 1, 1, 4, 4, 1, 1, 2, 2, 1, 1, 3, 3, 1, 1, 2, 2, 1, 1, 5, 5, 1, 1, 2, 2, 1, 1, 3, 3, 1, 1, 2, 2, 1, 1, 4, 4, 1, 1, 2, 2, 1, 1, 3, 3, 1, 1, 2, 2, 1, 1, 6, 6, 1, 1, 2, 2, 1, 1, 3, 3, 1, 1, 2, 2, 1, 1, 4, 4, 1, 1, 2, 2, 1, 1, 3, 3, 1, 1, 2, 2, 1, 1, 5, 5, 1, 1, 2, 2, 1, 1, 3, 3 (list; graph; listen)
OFFSET

0,4

COMMENT

a(even) = number of trailing binary zeros;

a(odd) = number of trailing binary ones;

a(n) = A050603(n-1) for n>0;

a(2*n + n mod 2) = a(n) + 1.

LINKS

Index entries for sequences related to binary expansion of n

FORMULA

For n>0: a(n) = A007814(n + n mod 2).

CROSSREFS

Sequence in context: A064894 A003638 A094267 this_sequence A050603 A037162 A027358

Adjacent sequences: A136477 A136478 A136479 this_sequence A136481 A136482 A136483

KEYWORD

nonn,base

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Dec 31 2007

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 November 25 13:47 EST 2009. Contains 167481 sequences.


AT&T Labs Research