Step 1: Divide the number into separate digits:
30228 => 3 0 2 2 8
Step 2: Calculate the distance between each digit and the next (the last digit with the first):
3 to 0 => 3
0 to 2 => 2
2 to 2 => 0
2 to 8 => 6
8 to 3 => 5
Step 3: Convert distances to codes (0=E[qual],
1 & 9 = C[onsecutive], 2-8 = N[one]):
3 => N
2 => N
0 => E
6 => N
5 => N
Step 4: Combine the filters to a string:
N N E N N = NNENN