Number of smallest coverings of the n-dipyramidal graph by maximal cliques.

Terms

a(0) =1a(1) =4a(2) =30a(3) =12a(4) =98a(5) =28a(6) =270a(7) =60a(8) =682a(9) =124a(10) =1638a(11) =252a(12) =3810a(13) =508a(14) =8670a(15) =1020a(16) =19418a(17) =2044a(18) =42966a(19) =4092a(20) =94162a(21) =8188a(22) =204750a(23) =16380a(24) =442314a(25) =32764a(26) =950214a(27) =65532a(28) =2031554a(29) =131068