recursion - A     F(1) = 1, F(n+1) = 2·F(n)

recursion - B     F(1) = 1, F(n+1) = (F(n) + K/F(n)) / 2, K=2

recursion - B1     F(1) = 1, F(n+1) = (F(n) + K/F(n)) / 2, K=16

recursion - C     F(1)=1, F(2)=1, F(n+2) = F(n)+F(n+1)

recursion - D     How to study  1² + 2² + 3² + ... + n² ?

recursion - E     How to study   F(n) = Σ k = 1 .. 2·n (−1)k·(2·k + 1) ? Is F(n) proportional to n?

See also "square root" and "cube root".

see / vedi