**Fibonacci Machine**

**The simple Fibonacci sequence 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, ..., where each term is the sum of the two preceding terms, inspired me the Fibonacci Machine that you could see below:**

**Imagine, in this machine, a start position where a=1 and b=1. Next step, b=old_a and a=old_a+old_b, and so on. To infinity, the Golden Mean appears on machine output.**

**You could imagine now a more complex machine, where the value of each cell is multiplied by a coefficient (k1, k2) before forming the feedback sum. It's the machine that you could see in the next picture:**

**The results are very interesting. In particular, the case a=1, b=3 and a=1, b=4 looks like a cabalistic calculation: in many cultures 13 and 17 are magic numbers.**

## k1 |
## k2 |
## RESULT |
## EXPRESSION |

## 1 |
## 1 |
## 1.61803... |
## Golden Mean |

## - |
## - |
## - |
## - |

## 1 |
## 2 |
## 2 |
## - |

## 1 |
## 3 |
## 2.30277... |
## (SQR(13)+1)/2 |

## 1 |
## 4 |
## 2.56155... |
## (SQR(17)+1)/2 |

## 1 |
## n |
## ... |
## (SQR(4*n+1)+1)/2 |

## - |
## - |
## - |
## - |

## 2 |
## 1 |
## 2.41421... |
## 1+SQR(2) |

## 3 |
## 1 |
## 3.30277... |
## (3+SQR(13))/2 |

## 4 |
## 1 |
## 4.23606... |
## 2+SQR(5) |

## 5 |
## 1 |
## 5.19258... |
## (5+SQR(29))/2 |

## n |
## 1 |
## ... |
## (n+SQR(n^2+4))/2 |

## - |
## - |
## - |
## - |

## 2 |
## 3 |
## 3 |
## - |

## 2 |
## 4 |
## 3.23606... |
## 1+SQR(5) |

**However, we can conceive more and more complex machines.**

**Link:**

| Pentominoes | More about pentominoes | The cube | 3D pentominoes | Sexominoes | Fibonacci Machine | Download | Links |