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!)
A140949 a(n) = number of iterations of k -> k-1/k until we reach a negative number, starting at n. 0

%I #2 Mar 31 2012 10:29:56

%S 3,6,10,14,20,26,34,43,52,63,74,87,100,115,130,147,164,183,202,223,

%T 244,267,290,315,341,367,395,423,453,483,515,547,581,615,651,687,725,

%U 763,803,843,885,927,971,1015,1061,1107,1155,1203,1253,1303,1355,1407,1461

%N a(n) = number of iterations of k -> k-1/k until we reach a negative number, starting at n.

%e a(2)=3 because 2-1/2=1.5; 1.5-1/1.5=0.83333; 0.83333-1/0.83333=-0.36667.

%K easy,nonn

%O 2,1

%A _Gil Broussard_, Jul 25 2008

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 24 04:14 EDT 2024. Contains 371918 sequences. (Running on oeis4.)