The Guthrie sequence of a positive number n is defined to be the numbers generated by the above algorithm.

Start with a positive number n if n is even then divide by 2
if n is odd then multiply by 3 and add 1 continue this until n becomes 1
The Guthrie sequence of a positive number n is defined to be the numbers generated by the above algorithm.
The Stanton measure of an array is computed as follows. Count the number of 1s in the array. Let this count be n.

The Stanton measure of an array is computed as follows. Count the number of 1s in the array. Let this count be n. The Stanton measure is the number of times that n appears in the array. For example, the Stanton measure of {1, 4, 3, 2, 1, 2, 3, 2} is 3 because 1 occurs 2 times in the array and 2 occurs 3 times.
A prime number is an integer that is divisible only by 1 and itself. A porcupine number is a prime number whose last digit is 9 and the next prime number that follows it also ends with the digit 9.

A prime number is an integer that is divisible only by 1 and itself. A porcupine number is a prime number whose last digit is 9 and the next prime number that follows it also ends with the digit 9.
An array is defined to be inertial if the following conditions hold

An array is defined to be inertial if the following conditions hold
Define a square pair to be the tuple where x and y are positive, non-zero integers, x

Define a square pair to be the tuple