\\ positive terms of A332520
vv = [0]
nb = 0
W = 2^X=4
explore(v, w) = {
	if (w==W,
		if (nb==#vv,
			vv = concat(vv, vector(#vv));
		);
		vv[nb++] = v,

		\\ prepend or append zeros
		explore(v, 2*w);
		explore(v<<w, 2*w);

		\\ duplicate
		if (bittest(v,0)==0 || bittest(v,w-1)==0,
			explore(v+v<<w, 2*w);
		);
	);
}

allocate mem(2^30);

for (x=0, X, explore(2^2^x-1, 2^x))
vv = Set(vv[1..nb])

{
	\\ repeatedly OR

	a  = vector(mx=2^13, n, oo);
	u  = 1;
	tt = [0];

	print ("0 0");
	for (v=1, oo,
		tt = select(t -> t<=mx, setbinop(bitor, tt, vv));
		for (k=1, #tt,
			if (tt[k]>mx,
					break,
					a[tt[k]] = min(a[tt[k]], v)
			);
		);

		while (a[u]!=oo,
			print (u " " a[u] " " hammingweight(u));
			if (u++>mx,
				break (2);
			);
		);
	);
}

quit