Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A139372
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A139372
%S A139372 0,1,3,4,5,6,7,9,12,13,15,16,17,18,19,20,21,22,23,24,25,27,28,29,30,
%T A139372 31,33,36,37,39,45,48,49,51,52,53,54,55,57,60,61,63,64,65,66,67,68,
%U A139372 69,70,71,72,73,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91
%N A139372 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).
%C A139372 e(n)+o(n) = A000120(n), the binary weight of n. For e(n) = o(n) see A039004.
%o A139372 See link in A139351 for Fortran program.
%Y A139372 Cf. A000120, A139351-A139355, A039004, A139370-A139373.
%Y A139372 Sequence in context: A161346 A096515 A100586 this_sequence A128659 A022555 
               A047308
%Y A139372 Adjacent sequences: A139369 A139370 A139371 this_sequence A139373 A139374 
               A139375
%K A139372 nonn
%O A139372 1,3
%A A139372 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 27 14:50 EST 2009. Contains 167570 sequences.


AT&T Labs Research