# Counting graceful paths

How can one count the number of graceful labelings of a path graph?

-
in the fifth talk in this list it is conjectured order $\log(n)\log(n−1)\dots \log(2)$ facstaff.unca.edu/pbahls/GGGstuff/2008/… –  Pietro Majer May 31 '11 at 8:44
Nice, thanks. I guess I had thought there would be a closed formula! –  Dr Shello Jun 2 '11 at 0:43