What comes next?

[C.Ret]

Bonjour à tous,

A big thank you to Thomas Klemm for this small but very clever program that works wonders to determine arbitrary sequences. Whatever they are!

I think it's great to have had the idea of ​​doing the sum while memorizing the differences. At the end of the program everything is already ready for the next determination. Excellent idea.

I use and abuse this little program that I transcribed for my HP-15C in order to be able to use it in the laboratory.

I had a much longer and much slower program that memorized the elements of the sequence and recalculated the descending and ascending differences at each determination.

And also thank you for the tip 1 RCL+0 STO 0 which is much shorter than the method with an ISG 0 that I used.

It is therefore with great pleasure that I share below a new version for HP-15C directly adapted from the algorithm proposed by Thomas.

Code:

001 {        1 }    1
002 { 45 40  0 }   RCL + 0
003 {    44  0 }   STO 0
004 {    44 25 }   STO I
005 {    43 35 } g CLx
006 {       34 }   X⇄Y
007 {       20 }    ×
008 { 42 21  0 } f LBL 0
009 {    43 36 } g LSTx
010 { 45 30 24 }   RCL - (i)
011 {    44 24 }   STO (i)
012 {       40 }    +
013 { 42  5 25 } f DSE I
014 {    22  0 }   GTO 0

This code is used exactly like Thomas's. So don't forget to do f CLEAR REG before introducing the elements of a new sequence.