Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A089309
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A089309
%S A089309 0,1,1,2,1,1,2,3,1,1,1,2,2,1,3,4,1,1,1,2,1,1,2,3,2,1,1,2,3,1,4,5,1,1,1,
%T A089309 2,1,1,2,3,1,1,1,2,2,1,3,4,2,1,1,2,1,1,2,3,3,1,1,2,4,1,5,6,1,1,1,2,1,1,
%U A089309 2,3,1,1,1,2,2,1,3,4,1,1,1,2,1,1,2,3,2,1,1,2,3,1,4,5,2,1,1,2,1,1,2,3,1
%N A089309 Write n in binary; a(n) = number of 1's in right-most block.
%F A089309 a(2n) = a(n), a(2n+1) = A007814(2n+2) = A001511(n+1). - Ralf Stephan 
               (ralf(AT)ark.in-berlin.de), Jan 31 2004
%e A089309 13 = 1101 so a(13) = 1.
%Y A089309 Cf. A089310-A089313.
%Y A089309 Sequence in context: A159864 A144790 A090996 this_sequence A126387 A038374 
               A161161
%Y A089309 Adjacent sequences: A089306 A089307 A089308 this_sequence A089310 A089311 
               A089312
%K A089309 nonn,base
%O A089309 0,4
%A A089309 N. J. A. Sloane (njas(AT)research.att.com), Dec 22 2003
%E A089309 More terms from Vladeta Jovovic (vladeta(AT)eunet.rs) and John W. Layman 
               (layman(AT)math.vt.edu), Jan 21 2004

    
page 1

Search completed in 0.001 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 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research