Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A019588
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A019588
%S A019588 1,2,1,3,5,2,5,1,5,9,3,8,13,5,11,2,9,16,5,13,1,10,19,5,15,25,9,20,3,15,
%T A019588 27,8,21,34,13,27,5,20,35,11,27,2,19,36,9,27,45,16,35,5,25,45,13,34,1,
%U A019588 23,45,10,33,56,19,43,5,30,55,15,41,67,25,52,9,37,65,20,49,3,33,63,15
%N A019588 The right budding sequence: # of i such that 0<i<=n and {tau*n} <= {tau*i} 
               < 1, where {} is fractional part.
%D A019588 J. H. Conway, personal communication.
%H A019588 N. J. A. Sloane, <a href="classic.html#WYTH">Classic Sequences</a>
%Y A019588 Cf. A019587.
%Y A019588 Sequence in context: A066748 A106583 A081450 this_sequence A060083 A069931 
               A056943
%Y A019588 Adjacent sequences: A019585 A019586 A019587 this_sequence A019589 A019590 
               A019591
%K A019588 nonn,easy,nice
%O A019588 1,2
%A A019588 N. J. A. Sloane (njas(AT)research.att.com) and J. H. Conway (conway(AT)math.princeton.edu)
%E A019588 Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Apr 18 2009

    
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 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research