It could be the following algorithm: A) Find all the solutions to the following pentic equation: Ax^5 + Bx^4 + Cx^3 + Dx^2 + Ex + F = 0. B) Take the absolute magnitude of all the solutions. C) Arrange the results from step B in ascending order.

The only thing is that I don't know what the values of A, B, C, D, E, and F would be. I guess it would involve taking the pentic formula and working our way backwards.

Or it could be the following algorithm: 1) List all the positive integers, including zero, in ascending order. 2) Now arrange these integers in a such a way that any integer N occurs N^N times. 3) List the number 4. 4) Take the number 4 and add the first number from the series described in step 2, and list it after 4. 5) Take the result from step 4 and add the second number from the series described in step 2, and list the result after the result from step 4. 6) Take the result from step 5 and add the third number from the series described in step 2. etc......

In other words: 4 - 4 = 0. 5 - 4 = 1. 7 - 5 = 2. 9 - 7 = 2. That's 0,1,2,2. 0 occurs one time because 0^0 is 1. 1 occurs one time because 1^1 is 1. 2 will occur 4 times, 3 will occur 27 times, 4 will occur 256 times, etc. Thus, take 4 and add 0 to it: 4, 4. Take 4 and add 1 to it. 4,4,5. Take 5 and add 2 to it. 4,4,5,7. Take 7 and add 2 to it. 4,4,5,7,9.

The next terms in that sequence should be 11, 13, 16, 19, 22....etc. In your case, the algorithm terminated after 7 steps.