Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A019587
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A019587 The left budding sequence: # of i such that 0<i<=n and 0 < {tau*i} <= {tau*n}, where {} is fractional part. +0
3
1, 1, 3, 2, 1, 5, 3, 8, 5, 2, 9, 5, 1, 10, 5, 15, 9, 3, 15, 8, 21, 13, 5, 20, 11, 2, 19, 9, 27, 16, 5, 25, 13, 1, 23, 10, 33, 19, 5, 30, 15, 41, 25, 9, 37, 20, 3, 33, 15, 46, 27, 8, 41, 21, 55, 34, 13, 49, 27, 5, 43, 20, 59, 35, 11, 52, 27, 2, 45, 19, 63, 36, 9, 55, 27, 74, 45, 16, 65 (list; graph; listen)
OFFSET

1,3

REFERENCES

J. H. Conway, personal communication.

LINKS

N. J. A. Sloane, Classic Sequences

CROSSREFS

Cf. A019588.

Sequence in context: A077819 A030313 A113977 this_sequence A102427 A080883 A021315

Adjacent sequences: A019584 A019585 A019586 this_sequence A019588 A019589 A019590

KEYWORD

nonn,easy,nice

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com) and J. H. Conway (conway(AT)math.princeton.edu)

EXTENSIONS

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