A010060(n) = hammingweight(n)%2

b(n) = A010060(n-1) \\ 0-based -> 1-based

same(u, v, w) = {
	for (i=1, w,
		if (b(u+i-1) != b(v+i-1),
			return (0);
		);
	);
	return (1);
}

w = 0	\\ last value (sequence is weakly increasing)
compute(n) = {
	for (u=1, n-w-1,
		if (same(u, n-w, w+1),
			w++;
			break;
		);
	);

	return (w);
}

u=1; for (n=1, oo, if (compute(n)==u, print (u " " n); if (u==4096, break, u++)))

quit