Maximum number of induced copies of the diamond graph K_{1,1,2} in an n-node graph.

Terms

a(0) =0a(1) =0a(2) =0a(3) =1a(4) =4a(5) =12a(6) =24a(7) =48a(8) =84a(9) =138a(10) =216a(11) =324a(12) =459a(13) =636a(14) =864a(15) =1152a(16) =1488a(17) =1900a(18) =2400a(19) =3000a(20) =3675a(21) =4470a(22) =5400a(23) =6480a(24) =7668a(25) =9030a(26) =10584a(27) =12348a(28) =14259a(29) =16408