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
A019588 The right budding sequence: # of i such that 0<i<=n and {tau*n} <= {tau*i} < 1, where {} is fractional part. +0
2
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, 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, 23, 45, 10, 33, 56 (list; graph; listen)
OFFSET

1,2

REFERENCES

J. H. Conway, personal communication.

LINKS

N. J. A. Sloane, Classic Sequences

CROSSREFS

Cf. A019587.

Adjacent sequences: A019585 A019586 A019587 this_sequence A019589 A019590 A019591

Sequence in context: A066748 A106583 A081450 this_sequence A060083 A069931 A056943

KEYWORD

nonn,easy,nice

AUTHOR

njas and J. H. Conway (conway(AT)math.princeton.edu)

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 October 10 20:39 EDT 2008. Contains 144831 sequences.


AT&T Labs Research