Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A089633
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A089633 Numbers having not more than one 0 in their binary representation. +0
4
0, 1, 2, 3, 5, 6, 7, 11, 13, 14, 15, 23, 27, 29, 30, 31, 47, 55, 59, 61, 62, 63, 95, 111, 119, 123, 125, 126, 127, 191, 223, 239, 247, 251, 253, 254, 255, 383, 447, 479, 495, 503, 507, 509, 510, 511, 767, 895, 959, 991, 1007, 1015, 1019, 1021, 1022, 1023 (list; graph; listen)
OFFSET

0,3

COMMENT

A023416(a(n))<=1; A023416(a(n))=A023532(n-2) for n>1;

A000120(a(u))<=A000120(a(v)) for u<v; A000120(a(n))=A003056(n).

Complement of A158582. [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Apr 16 2009]

LINKS

Index entries for sequences related to binary expansion of n

FORMULA

a(0)=0, n>0: a(n+1) = Min{m>n: BinOnes(a(n))<=BinOnes(m)} with BinOnes=A000120.

If m = floor( (sqrt(8*n+1) - 1) / 2 ), then a(n) = 2^(m+1) - 2^(m*(m+3)/2 - n) - 1 [From Carl R. White (oeisfan(AT)phodd.net), Feb 10 2009]

CROSSREFS

Cf. A007088.

Sequence in context: A080980 A134669 A053328 this_sequence A003172 A053329 A098962

Adjacent sequences: A089630 A089631 A089632 this_sequence A089634 A089635 A089636

KEYWORD

nonn,base

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jan 01 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 December 8 08:31 EST 2009. Contains 170430 sequences.


AT&T Labs Research