Maximum number of graceful labelings for a simple graph on n nodes.
A333728
Maximum number of graceful labelings for a simple graph on n nodes.
Terms
- a(0) =1a(1) =2a(2) =12a(3) =48a(4) =168a(5) =1152a(6) =9600a(7) =97920
External references
- oeis: A333728