Padovan sequence: Difference between revisions

Line 2,228:
 
all 32 terms match for Padovan terms and lengths of L_sys terms.
</pre>
 
=={{header|RPL}}==
≪ '''IF''' DUP 2 ≤ '''THEN''' DROP 1
'''ELSE''' 1 1 1
3 5 ROLL START OVER + ROT ROT NEXT DROP2
'''END'''
≫ ''''PDVAN1'''' STO
≪ 1.32471795724 SWAP 1 - ^ 1.04535679325 / 0.5 + FLOOR ≫ ''''PDVAN2'''' STO
≪ {{ "" "A" } { "A" "B" } { "B" "C" } { "C" "AB" }}
1 4 '''FOR''' j
DUP j GET
'''IF''' 3 PICK OVER 1 GET == '''THEN''' 2 GET 5 'j' STO '''ELSE''' DROP '''END'''
'''NEXT'''
ROT ROT DROP2
≫ ''''RULE→'''' STO
≪ "" 1 ROT '''START'''
"" 1 3 PICK SIZE '''FOR''' j
OVER j DUP SUB '''RULE→''' + '''NEXT'''
SWAP DROP '''NEXT'''
≫ ''''LSTRN'''' STO
{{in}}
<pre>
≪ {} 0 63 FOR j j PDVAN1 + NEXT ≫ EVAL
≪ 1 CF
0 63 FOR j IF j PDVAN1 j PDVAN2 ≠ THEN 1 SF END NEXT
1 SF? "Different results" "64 same results" IFTE
≫ EVAL
≪ {} 1 32 FOR j j LSTRN + NEXT ≫ EVAL
≪ {} 0 31 FOR j j PDVAN2 + NEXT ≫ EVAL
DUP ==
</pre>
{{out}}
<pre>
4: { 1 1 1 2 2 3 4 5 7 9 12 16 21 28 37 49 65 86 114 151 }
3: "64 same results"
2: { 1 1 1 2 2 3 4 5 7 9 12 16 21 28 37 49 65 86 114 151 200 265 351 465 616 816 1081 1432 1897 2513 3329 4410 }
1: 1
</pre>
 
Line 2,271 ⟶ 2,312:
Sizes of first 32 l_system strings equal to recurrence padovan? true.
</pre>
 
=={{header|Rust}}==
<syntaxhighlight lang="rust">fn padovan_recur() -> impl std::iter::Iterator<Item = usize> {
1,150

edits