#(loop[n[%]](let[f(let[s(str(last n))](apply +(for[a(range(count s))](apply *(range 1(inc(int(nth s a))))))))](if(some #{f}n)n(recur(conj n f)))))

(defn fact-cycle [n]
  (loop [nums [n]]
    (let [fact-num
          (let [str-n (str (last nums))]
            (apply +
              (for [a (range (count str-n))]
                (apply *
                  (range 1
                    (inc (int (nth str-n a))))))))]
      (if (some #{fact-num} nums) nums
        (recur
          (conj nums fact-num))))))

void c(int[]a){int b=a.length-1,d=0,c=0,e;for(;d<b*b;c=++d%b)if(a[c]>a[c+1]){e=a[c];a[c++]=a[c];a[c]=e;}}

void a(int[]a){for(int b=a.length-1,d=0,c=0,e;d<b*b;c=++d%b)if(a[c]>a[c+1]){e=a[c];a[c++]=a[c];a[c]=e;}}

[dyad]1¡[nilad] = dyad(v, nilad)
[dyad]2¡[nilad] = dyad(dyad(v, nilad), v)
[dyad]3¡[nilad] = dyad(dyad(dyad(v, nilad), v), dyad(v, nilad))

Hello
e
l
l
o

Qjt
QjtQ "implicit Q"
Q    "implicitly print the input. end of command."
   Q "input"
  t  "tail (remove the first element)"
 j   "join (implicitly by newlines)"
     "implicitly print the above as well"

,[.>,]<[<]>>[<[-]++++++++++.>.>]

#^-1//./gS"
"v#

.(.+)
$&¶$1
+`(?<=¶.).
¶$&

*`


¶
^¶.¶
trailing newline here