Number of proper 3-partitions of the vertices of the fan graph on n vertices such that every triangle uses exactly 2 colors.

A389886

Number of proper 3-partitions of the vertices of the fan graph on n vertices such that every triangle uses exactly 2 colors.

Terms

    a(0) =0a(1) =1a(2) =4a(3) =11a(4) =27a(5) =62a(6) =137a(7) =295a(8) =624a(9) =1303a(10) =2695a(11) =5534a(12) =11301a(13) =22979a(14) =46568a(15) =94123a(16) =189843a(17) =382270a(18) =768721a(19) =1544207a(20) =3099360a(21) =6216431a(22) =12461519a(23) =24969406a(24) =50013837a(25) =100149067a(26) =200494552a(27) =401306915a(28) =803128059a(29) =1607088158

External references