Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A139370
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A139370 Let the binary expansion of n be n = Sum_{k} 2^{r_k}, let e(n) be the number of r_k's that are even, o(n) the number that are odd; sequence lists n such that e(n) < o(n). +0
13
2, 8, 10, 11, 14, 26, 32, 34, 35, 38, 40, 41, 42, 43, 44, 46, 47, 50, 56, 58, 59, 62, 74, 98, 104, 106, 107, 110, 122, 128, 130, 131, 134, 136, 137, 138, 139, 140, 142, 143, 146, 152, 154, 155, 158, 160, 161, 162, 163, 164, 166, 167, 168, 169, 170, 171 (list; graph; listen)
OFFSET

1,1

COMMENT

e(n)+o(n) = A000120(n), the binary weight of n. For e(n) = o(n) see A039004.

Primes of this sequence are in A065049; but A065049 contains also other primes (see A152715). [From Vladimir Shevelev (shevelev(AT)bgu.ac.il), Dec 11 2008]

PROGRAM

See link in A139351 for Fortran program.

CROSSREFS

Cf. A000120, A139351-A139355, A039004, A139371-A139373.

Sequence in context: A053372 A088155 A005876 this_sequence A152754 A101532 A032708

Adjacent sequences: A139367 A139368 A139369 this_sequence A139371 A139372 A139373

KEYWORD

nonn

AUTHOR

Nadia Heninger (nadiah(AT)cs.princeton.edu) and N. J. A. Sloane (njas(AT)research.att.com), Jun 07 2008

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 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research