Recursive Calls to a function, how? [closed]

Question

I want to create a function (or anything, really) that is capable of calling its own logic.

The idea is as follows:

Funccall[a_,b_,n_]:=
  For[i=1,i<=n,i++,{Return[i*(4+i/3)*Funccall[a,b,n-1];}

or something like that. Not the exact function; it's too long. How do i achieve this effect?

Edit

Here's the purpose of the code: to generate all products from a matrix from elements which dont share rows or columns

For[i in n, for j in n, for k in in [This goes on till n times i.e. n for loops]
  if j!=i && k!=i &&k!=j &&.....->Multiply[a1i,a2j,a3k,a4l..........]

I need a function to do this.

The If condition I've implemented by creating an empty array used that stores whatever numbers have been used, and then I use FreeQ[used, k].

I hope this gives some clarity.

Answer 1

In a simple pseudo code this is a simple Recursive method to visit all nodes in a tree and set the X,Y to known values. It will unwind itself when the maximum depth has been reached. This might help you with some logic. Sorry its not your native format.

    To initialise:
    Call Recurse(RootNode, 1, 1, 0, 20)

    Recurse(TreeNode node, int X, int Y, int depth, int MaxDepth) {

      node.X = X
      node.Y = Y
      depth++
      if (depth == MaxDepth)    
       return

      TreeNode nextNode = node.NextNode
      Recurse(nextNode, X, Y, depth, MaxDepth)

    }