To cut off the first column,  awk, kde   utility could be used.

Alternate Answer:
A number of Unix commands can be used - cut, awk, sed or even a Perl one-liner.

Binary Exponential Backoff Algorithm was chosen to dynamically adapt to the number of stations trying to send. If the randomization interval for all collision was 1023 slots, the chance of two stations colliding for a second time  would be negligible, but the average wait after a collision would be hundreds of slot times, introducing significant delay. On the other hand, if each station always delayed for either 0 or 1 slot, then if 100 stations ever tried to send at once, they would collide over and over until 99 of them picked 1 and the remaining station picked 0. This may take years. But having the randomization interval grow exponentially as more and more consecutive collisions occur, the algorithm ensures a low delay when only a few stations collide but also ensures that the collision is resolved in a reasonable interval when many stations collide. Truncating the backoff at 1023 keeps the bound from growing too large.

On AIX use  --
groups -To Display full list
id -G - To display group id number

On Solaris use --
groups - To display full list
id -a - To diaplsy full list of groups with group id numbers

30
Consider the number at the odd position, ignor the number at the even position. We have :
2  =1*2
6  =2*3
12=3*4
20=4*5
so the next number must be :
5*6=30.