Maximum number of fundamentally different graceful labelings for a simple graph of n nodes without isolated vertices.
A339892
Maximum number of fundamentally different graceful labelings for a simple graph of n nodes without isolated vertices.
Terms
- a(0) =1a(1) =1a(2) =5a(3) =26a(4) =126a(5) =680a(6) =3778a(7) =22033
External references
- oeis: A339892