The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A089808 a(n) = floor(1/((n*r) mod 1)), where r = phi^(-2) = (3 - sqrt(5))/2. 4
 2, 1, 6, 1, 1, 3, 1, 17, 2, 1, 4, 1, 1, 2, 1, 8, 2, 1, 3, 1, 46, 2, 1, 5, 1, 1, 3, 1, 12, 2, 1, 4, 1, 1, 2, 1, 7, 1, 1, 3, 1, 23, 2, 1, 5, 1, 1, 2, 1, 10, 2, 1, 4, 1, 122, 2, 1, 6, 1, 1, 3, 1, 15, 2, 1, 4, 1, 1, 2, 1, 8, 1, 1, 3, 1, 33, 2, 1, 5, 1, 1, 3, 1, 11, 2, 1, 4, 1, 1, 2, 1, 7, 1, 1, 3, 1, 19, 2, 1, 5, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS 1. a(n) = 1 iff A024569 is not 1, (A024569 = 1, 4, 1, 2, 11, 1, 3, 1, 1, ...) 2. a(n) = 1 iff A078588 = 0. 3. a(n) = 1 iff A089809 = 1. LINKS G. C. Greubel, Table of n, a(n) for n = 1..5000 EXAMPLE a(6) = 3. Take 6*r = 2.29179...( mod 1) = 0.29179...; invert = 3.42705... and delete the fractional part, getting 3. MATHEMATICA r := (3 - Sqrt[5])/2; Table[Floor[1/(Mod[(n*r), 1])], {n, 1, 50}] (* G. C. Greubel, Nov 20 2017 *) CROSSREFS Cf. A024569, A078588, A089809. Sequence in context: A094673 A196839 A295315 * A290318 A139547 A323855 Adjacent sequences:  A089805 A089806 A089807 * A089809 A089810 A089811 KEYWORD nonn,easy AUTHOR Gary W. Adamson, Nov 11 2003 EXTENSIONS More terms from Sam Alexander, Nov 16 2003 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 1 10:33 EDT 2020. Contains 333159 sequences. (Running on oeis4.)