Help with recursion

I have a simple recursion of the following form;

x_sub_n = x_sub_(n-1) + K/log(n),

n >= 2,

K a constant of about 0.1

initial condition x_sub_1 = 0

I seek a solution for x_sub_n without going through all the recursive
calculations. Any help appreciated!


Bob Adams

.

Relevant Pages

  • Re: FIbonacci
    ... > Peteris Krumins wrote: ... prev2 is Fand prev is F. ... using continuation-passing style and tail recursion, ...
    (comp.lang.c)
  • Re: Towers of Hanoi
    ... the way won't help you with the recursion. ... changing the base case to 0 might make it more concise or ... elegant. ... Prev by Date: ...
    (comp.lang.scheme)
  • Re: Regarding JTree
    ... Then you use recursion ... to traverse the tree. ... http://mindprod.com Again taking new Java programming contracts. ... Prev by Date: ...
    (comp.lang.java.gui)
  • Re: Not enough stack to call filing system
    ... in adfs::4.$.Apps causing a recursion. ... Theo ... Prev by Date: ...
    (comp.sys.acorn.misc)
  • Re: Windows 2003 external nslookup times out, internal works
    ... under the advanced tab the box to disable ... recursion should be empty. ... Prev by Date: ...
    (microsoft.public.windows.server.dns)