Bit formula

I'm trying to figure out the formula/algorithm to get a bit mask based on the bit position. I've run across it in the past, but don't remember where.

Something like:
int getBitMask(byte bitNo) {...

Where:
bitNo returns
0 = 00000001 (1)
1 = 00000010 (2)
2 = 00000100 (4)
3 = 00001000 (8)
4 = 00010000 (16)
5 = 00100000 (32)
6 = 01000000 (64)
7 = 10000000 (128)
etc.

I'm sure someone out there has it handy. Thanks in advance!

(1<<bit_number)

Duh! I knew it was something simple. Thanks!

I love how 8 is just soo cool! 8)