Maximum number of fundamentally different graceful labelings for a simple graph of n nodes.
A379395
Maximum number of fundamentally different graceful labelings for a simple graph of n nodes.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =5a(4) =26a(5) =126a(6) =680a(7) =3876a(8) =25501
External references
- oeis: A379395