JavaScript (Node.js), 68 bytes
f=(a)=>a.map((x)=>[...x.entries()].filter((e)=>e[1]).map((e)=>e[0]))
Run the function f on your input, e.g. f([[1,0,1],[1,0,1],[0,1,0]]).
The output ...
JavaScript (Node.js), 73 66 bytes
This returns a Generator, which calculates the sequence on the fly when you use it!
function*f(a){while(a>1){yield a
a=~~(a%2?a**1.5:a**0.5)}
yield a}
Or...
Perl, 9 bytes
/[abipq]/
Perl's got an m// operator (which you also get if you use a bare regex, like here) that by default matches on $_. Returns true if it matches, false if it doesn't.
The r...
Swift 5.4, 17 bytes
func f(){f()};f()
Pretty simple. It just calls itself until it stack overflows. You need to compile and run it, not just do it in the REPL, because the REPL just drops you b...
JavaScript (Node.js), 51 bytes
n=[];f=(a)=>a&&a.map?(n.push(a.length),f(a[0]),n):n
Run f on your input, e.g. f([[],[]]).
Explanation:
n=[]; // make a global array to hold the res...
