fibonacci-recursive-agents

Invoke the Skill with a phrase like "run fibonacci test" and optionally specify n (default is 3). The Skill creates a root agent with the recursive prompt, waits for completion, then renders the full agent tree as nested markdown links.

Each agent receiving fib(N) with N >= 2 spawns two child agents for fib(N-1) and fib(N-2) instead of computing them directly. Base cases fib(0) and fib(1) return immediately without children, and parents sum their children's results.

The output shows the computed result followed by a nested markdown list where each node is a link like [fib(N)](birdhouse:agent/agent_ID). Indentation of two spaces per level reflects the parent-child hierarchy from the root agent downward.

Naive recursive Fibonacci spawns two children per non-base call, so the agent count follows the Fibonacci recurrence itself. For n=3 the tree has 5 agents, but larger n values create exponentially more agents, which is the point of the stress test.

Avoid large n values since agent count grows exponentially and can exhaust runtime resources. This Skill is an internal test case for validating agent delegation, not an efficient way to compute Fibonacci numbers.