I can't see any native bitwise operators (like C++'s & and ^) in Maxima, is the right way to drop down into CLisp something like this?
:lisp boole-and 5 7
Many thanks,
Duncan
I think (maybe) what he's saying is that for any item g(n), the value will be the sum of all previous items excluding n-1. The notation's a little unclear, but the G(G(n-1)) part is repeated until n=1.
So for e.g.
5 = 2 + 1 + 1 + 1 (skipping 3)
8 = 3 + 2 + 1 + 1 + 1 (skipping 5)
13 = 5...
I've been reading Godel, Escher and Bach. In chapter V 'Recursive Structures and Processes' there's a recursive function given for Diagram G as:
G(n) = n - G(G(n-1)) // for n > 0
G(0) = 0
I can codify the Fibonacci seq that the diagram creates as:
$f=1,1;foreach($n in 3..30){$f +=...