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!)
A080023 log_phi(n) is closer to an integer than is log_phi(m) for any m with 2<=m<n, where phi=(1+sqrt(5))/2 is the golden ratio. 9

%I #9 Jun 24 2014 01:08:35

%S 2,3,4,7,11,18,29,47,76,123,199,322,521,843,1364,2207,3571,5778,9349,

%T 15127,24476,39603,64079,103682,167761,271443,439204,710647,1149851,

%U 1860498,3010349,4870847,7881196,12752043,20633239,33385282,54018521

%N log_phi(n) is closer to an integer than is log_phi(m) for any m with 2<=m<n, where phi=(1+sqrt(5))/2 is the golden ratio.

%C This is the sequence of Lucas numbers (A000032) without the term 1.

%D Suggested by _Neil Fernandez_, Jan 19 2003

%e log_phi(2) = 1+0.440..., log_phi(3) = 2+0.283..., log_phi(4) = 3-0.119..., log_phi(7) = 4+0.0437...

%o (PARI) lista(nn) = {flmin = 1; phi = (1 + sqrt(5))/2; for (i = 2, nn, li = log(i)/log(phi); fli = abs(round(li) - li); if (fli < flmin, print1(i, ", "); flmin = fli;););} \\ _Michel Marcus_, Aug 29 2013

%Y Cf. A000032, A080021, A080022.

%K nonn,easy

%O 1,1

%A _Dean Hickerson_, Jan 20 2003

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 25 11:30 EDT 2024. Contains 371967 sequences. (Running on oeis4.)