Mini-Challenge: Rudin-Shapiro Sequence

[Allen]

Not quite to 1000, but I found a LCG with multiplier 14, increment 2 and prime 3449 that to my surprise will generate the first 33 bit entries of the Zero-one version of Golay-Rudin-Shapiro sequence in only 44 bytes, including the "RSS" label.

Code:


00 { 44-Byte Prgm }
01>LBL "RSS"
02 2
03 STO 00
04 33
05 STO 01
06>LBL 00
07 RCL 00
08 14
09 ×
10 2
11 +
12 3449
13 MOD
14 STO 00
15 64
16 ÷
17 1
18 AND
19 PRX
20 DSE 01
21 GTO 00
22 .END.

Yields:

Code:


           0.0000    ***
           0.0000    ***
           0.0000    ***
           1.0000    ***
           0.0000    ***
           0.0000    ***
           1.0000    ***
           0.0000    ***
           0.0000    ***
           0.0000    ***
           0.0000    ***
           1.0000    ***
           1.0000    ***
           1.0000    ***
           0.0000    ***
           1.0000    ***
           0.0000    ***
           0.0000    ***
           0.0000    ***
           1.0000    ***
           0.0000    ***
           0.0000    ***
           1.0000    ***
           0.0000    ***
           1.0000    ***
           1.0000    ***
           1.0000    ***
           0.0000    ***
           0.0000    ***
           0.0000    ***
           1.0000    ***
           0.0000    ***
           0.0000    ***