This is the Middle-Square Method as proposed by John von Neumann in 1949. For our purposes, we are going to use the middle six digits of the seed.

As the results clearly show, this PRNG has an abymsally short period, and thus has little chance of passing any of the tests. Surprisingly enough, it does manage to pass them occasionally, such as its success with the Count the 1s test.

// The current state value
state = 1138;

// random number generator
function RandomNumber() {

	// Multiply the state by itself
	tmp = state * state;

	// Add enough padding to make it at least 8 digits
	tmp.pad_left('0', 8);

	// Save the middle 6 digits
	state = tmp.substr( (tmp.length / 2) - 3 , 6 );

	// Return the new value
	return state;

}