Divinacci Sequence – codegolf.stackexchange.com

Divinacci (OEIS) Perform the Fibonacci sequence but instead of using: f(n) = f(n-1)+f(n-2) Use: f(n) = sum(divisors(f(n-1))) + sum(divisors(f(n-2))) For an input of n, output the nth term, your ...

from Hot Questions - Stack Exchange OnStackOverflow
via Blogspot

Share this

Google Facebook Twitter More

• Digg
• Linkedin
• Stumbleupon
• Delicious
• Tumblr
• BufferApp
• Pocket
• Evernote

Unknown