[seqfan] A109733

[David Wilson]

A C++ function for efficiently computing A190733.
Perhaps an MMA geek could translate and check.

int f(int n)
{
	--n;
	if (n == 0) return 53;
	int k = f(n/2);
	if (n%2 == 0)
	{
		if (k < 50) return 52;
		else return 53;
	}
	else
	{
		if (k < 50) return k + 8;
		else return k - 2;
	}
}