Post Reply 
Best calculator for recurrence relations
02-25-2020, 03:08 PM (This post was last modified: 02-25-2020 03:10 PM by Csaba Tizedes.)
Post: #11
RE: Best calculator for recurrence relations
(02-23-2020 07:09 PM)John Keith Wrote:  Neat, but can you do this with SEQ? Confused

a(1)=a(2)=1; for n>2, a(n)=a(a(n-2))+a(n-a(n-2))
1, 1, 2, 3, 3, 4, 5, 6, 6, 7, 7, 8, 9, 10, 10, 11, 12, 12, 13, 14, 15, 16, 16, 17, 17, 18, 19, 19, ...

I don't know how it is works on HPs, but on TI-83 you can do something like this:

first decide the max. index of your list: N
then generate the list, let's say Z: seq(1,X,1,N,1)->LZ
finally generate the sequence: augment({1,1},seq(LZ(LZ(X-2))+LZ(X-LZ(X-2)),X,3,N,1))->LZ
and press ENTER until the result list is not change.

Just an idea, must to check, but I'm sure it is works.

There are models where sequences are implemented, maybe you can do it on those models (HP38/39 models, some CASIO models), but I am not sure the result is a list, maybe a table in an application.

Find all posts by this user
Quote this message in a reply
Post Reply 

Messages In This Thread
RE: Best calculator for recurrence relations - Csaba Tizedes - 02-25-2020 03:08 PM

User(s) browsing this thread: 1 Guest(s)