Number of fundamentally different graceful labelings of the n-path graph.
A387805
Number of fundamentally different graceful labelings of the n-path graph.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =2a(5) =6a(6) =8a(7) =10a(8) =30a(9) =74a(10) =162a(11) =332a(12) =800a(13) =2478a(14) =6398a(15) =13980a(16) =35798a(17) =127674a(18) =362824a(19) =874336a(20) =2612956a(21) =9642676a(22) =29728748a(23) =78808968a(24) =253706188a(25) =990921124a(26) =3291532538a(27) =9461575476a(28) =32626991772a(29) =133329657734
External references
- oeis: A387805