# code: http://golf.shinh.org/reveal.rb?primepolydivisible+numbers/tails_1759600402&nbb # target Nibbles version: 1.00 # commenter version: 0.1.6.187 #(implicit map):[[chr]] + #(add):[int] 2 #(integer):int , #(range from 1):[int] 10 #(integer):int \B A : #(append):[chr] * #(join):[chr] ; #(save):[chr] "\n" #(string):[chr] sets C + #(concat):[int] =\ #(scanl):[[int]] | #(filter):[int] , #(range from 1):[int] fstInt #(;$):int \D == #(equal?):int 2 #(integer):int \E % #(modulus):int ^ #(pow):int 2 #(integer):int D #(@):int D #(@):int \G F >> #(tail):[int] `% #(step):[int] ~ #(auto = 2):auto ; #(save):[int] `, #(range from 0):[int] B #(;$):int sets H \J I | #(filter):[int] + #(concat):[int] . #(map):[[int]] I #(@):[int] \K + #(add):[int] * #(multiply):int B #(;_):int K #($):int H #(;$):[int] ~ #(not):null \L % #(modulus):int #(implicit arg = L):int #(implicit arg = J):int #(implicit arg = C):[chr]