Puzzle - RPL and others

[Allen]

I was traveling this past week and had no internet most of the time, so I am submitting a little late..

I propose a 63 Byte solution for 41c/42s with a slight rube-goldberg look to the code to minimize size, but maintains divisibility throughout.

Registers Used: 5
Program Constants: 19, 3
Initial Entry: None
Returns: X-register 381654729

( possible I made some mistakes)

Code:


00 { 63-Byte Prgm }
01 19               initialize coefficients for polynomial  a=19
02 STO 02
03 3
04 STO 00      first divisor is 3
05 STO 03
06 X^2
07 +/-
08 STO 04          b=-9
09 STO 01          running total starts with -9 for various reasons 
10 STO× 03         c=-27 
11>LBL 01
12 RCL 01           \  
13 RCL× 04             multiply reg. 01 by 10
14 STO- 01         /
15 RCL 02         \
16 RCL× 00          set up horner-form polynomial of a*x^3+b*x^2+c*x - total %x   
17 RCL+ 04          add   x (x (19 x - 9) - 27) - total %x
18 RCL× 00
19 RCL+ 03
20 RCL× 00       /
21 RCL 01
22 RCL 00
23 MOD      
24 -              subtract constant term to ensure divisibility
25 STO+ 01      update running total
26 ISG 00       increment the central number to check for divisibility
27 X<>Y         NOP
28 RCL 01       \
29 RCL× 00
30 LOG             loop if running total is too small
31 RCL+ 04
32 X<0?         /
33 GTO 01
34 RCL 01       recall answer (divisible by 9 but not pandigital)
35 RCL+ 02      
36 DSE ST X     add (a-1)
37 .END.