Number of fundamentally different graceful labelings of the complete tripartite graph K_{1,1,n}.
A339891
Number of fundamentally different graceful labelings of the complete tripartite graph K_{1,1,n}.
Terms
- a(0) =1a(1) =4a(2) =7a(3) =12a(4) =20a(5) =34a(6) =74a(7) =131a(8) =260a(9) =524a(10) =1030a(11) =2054a(12) =4118a(13) =8196a(14) =16389a(15) =32804a(16) =65554a(17) =131074a(18) =262216a(19) =524292a(20) =1048580a(21) =2097304a(22) =4194312a(23) =8388619a(24) =16777478a(25) =33554436a(26) =67108906a(27) =134218244a(28) =268435464a(29) =536870914
External references
- oeis: A339891