login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A283747 a(n) = least m such that 1/2^(n+1) < f(m) < 1/2^n, where f(m) = fractional part of m*(golden ratio). 1

%I #15 Aug 06 2017 22:41:20

%S 1,4,2,5,13,68,34,89,466,233,610,1597,8362,4181,10946,28657,150050,

%T 75025,196418,1028458,514229,1346269,3524578,18454930,9227465,

%U 24157817,126491972,63245986,165580141,433494437,2269806340,1134903170,2971215073,15557484098

%N a(n) = least m such that 1/2^(n+1) < f(m) < 1/2^n, where f(m) = fractional part of m*(golden ratio).

%C This is column 1 of A283740; |a(n+1) - a(n)| is a Fibonacci number for n >= 1.

%t g = GoldenRatio; z = 50000; t = Table[N[FractionalPart[n*g]], {n, 1, z}];

%t r[k_] := Select[Range[z], 1/2^(k + 1) < t[[#]] < 1/2^k &, 1];

%t Flatten[Table[r[k], {k, 0, 200}]] (* A283747 *)

%Y Cf. A000045, A001622, A283740, A283748.

%K nonn,easy

%O 0,2

%A _Clark Kimberling_, Mar 17 2017

%E Offset and a(16) corrected and a(17)-a(33) added by _Jon E. Schoenfield_, Apr 02 2017

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 20:33 EDT 2024. Contains 371916 sequences. (Running on oeis4.)