Golfing Chain (Cops' Thread)
OEIS A000041, cracked by ETHproductions
Let's try it the other way around: golflang generates non-golflang.

a(n) = number of partitions of n (the partition numbers).


a(n) (0-indexed) is returned by a JavaScript function (ES6)
The program that outputs the JS function is written in Jelly
The length of the Jelly program is 35 bytes

Intended solution

    Jelly: “¦ṚoIwƭ- ḊFæSḂ¥¶Ẉ|ḊJƓƝʋnrB⁾’b28+40Ọ


    which outputs


    JS: C=(A,B=A)=&gt;A&lt;0?0:A?B?C(A,B-1)+C(A-B,B):0:1