Cute Fibonacci variant

David W. Wilson wilson at aprisma.com
Mon Aug 20 17:20:41 CEST 2001


a(0) = 0
a(1) = 1
a(n) = (k-1) a(n-1) a(n-2) + a(n-1) + a(n-2)

k = 0 obviously gives the Fibs.
Try k = 10 next.





More information about the SeqFan mailing list