 | 1 | initial version |
Is there a built in general recurrence sequence function like the binary recurrence sequence?
def a(n): return BinaryRecurrenceSequence(a,b,c,d)
returns the sequence $U_0=c$, $U_1=d$, and $U_n=aU_{n-1}+bU_{n-2}$.
I would like something that returns $U_n=aU_{n-1}+bU_{n-2}+cU_{n-3}$
Any help is much appreciated!
Is there a built in general recurrence sequence function like the binary recurrence sequence?
returns the sequence $U_0=c$, $U_1=d$, and $U_n=aU_{n-1}+bU_{n-2}$.
I would like something that returns $U_n=aU_{n-1}+bU_{n-2}+cU_{n-3}$
Any help is much appreciated!
Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.