C-c-c-conjecturing, and dealing with recursion in Emacs (more excursus)

( let (( count ( or count 0 ))) ( print ( format "Step %s: %s" count n )) ( setq count ( 1+ count )) ( cond (( = n 1 ) 1 ) (( evenp n ) ( C-verbose ( / n 2 ) count )) ( t ( C-verbose ( 1+ ( * 3 n )) count ))))) ( C-verbose 7 ) ; = ;; "Step 0: 7" ;; "Step 1: 22" ;; "Step 2: 11" ;; "Step 3: 34" ;; "Step 4: 17" ;; "Step 5: 52" ;; "Step 6: 26" ;; "Step 7: 13" ;; "Step 8: 40" ;; "Step 9: 20" ;; "Step 10: 10" ;; "Step 11: 5" ;; "Step 12: 16" ;; "Step 13: 8" ;; "Step 14: 4" ;; "Step 15: 2" ;; "Step 16: 1" ( C-verbose 9 ) ; = ;; "Step 0: 9" ;; "Step 1: 28" ;; "Step 2: 14" ;; "Step 3: 7" ;; "Step 4: 22" ;; "Step 5: 11" ;; "Step 6: 34" ;; "Step 7: 17" ;; "Step 8: 52" ;; "Step 9: 26" ;; "Step 10: 13" ;; "Step 11: 40" ;; "Step 12: 20" ;; "Step 13: 10" ;; "Step 14: 5" ;; "Step 15: 16" ;; "Step 16: 8"…