Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A134567
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A134567 a(n) = least m such that {-m*tau}<{n*tau}, where { } denotes fractional part and tau = (1+sqrt(5))/2. +0
3
1, 3, 1, 1, 8, 1, 3, 1, 1, 3, 1, 1, 21, 1, 3, 1, 1, 8, 1, 3, 1, 1, 3, 1, 1, 8, 1, 3, 1, 1, 3, 1, 1, 55, 1, 3, 1, 1, 8, 1, 3, 1, 1, 3, 1, 1, 21, 1, 3, 1, 1, 8, 1, 3, 1, 1, 3, 1, 1, 8, 1, 3, 1, 1, 3, 1, 1, 21, 1, 3, 1, 1, 8, 1, 3, 1, 1, 3, 1, 1, 8, 1, 3, 1, 1, 3, 1, 1, 144, 1, 3, 1, 1, 8, 1, 3, 1, 1, 3, 1, 1, 21 (list; graph; listen)
OFFSET

1,2

COMMENT

The terms are members of A001906, the even-indexed Fibonacci numbers. The defining inequality {-m*tau}<{n*tau} is equivalent to {m*tau}+{n*tau}>1.

EXAMPLE

a(2)=3 because {-m*tau}>{2*tau}=.236... for m=1,2, whereas {-3*tau}=.145..., so that 3 is the least m for which {-m*tau}<{3*tau}.

CROSSREFS

Cf. A134566, A134570, A134571.

Sequence in context: A112492 A049290 A147990 this_sequence A131932 A016462 A121461

Adjacent sequences: A134564 A134565 A134566 this_sequence A134568 A134569 A134570

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu), Nov 01 2007

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 25 08:46 EST 2009. Contains 167481 sequences.


AT&T Labs Research