How many AVL trees of maximum height compared to the height?

I have a little trouble finding a recursive formula to find the maximum number of AVL trees in height h. The height 0 to 1, the height 1 to 2, the height 2 to 4, the height 3 to 8, etc. is it correct?