Orchard crossing number of complete bipartite graph K_{1,n}.

Terms

a(0) =0a(1) =0a(2) =0a(3) =2a(4) =5a(5) =12a(6) =21a(7) =36a(8) =54a(9) =80a(10) =110a(11) =150a(12) =195a(13) =252a(14) =315a(15) =392a(16) =476a(17) =576a(18) =684a(19) =810a(20) =945a(21) =1100a(22) =1265a(23) =1452a(24) =1650a(25) =1872a(26) =2106a(27) =2366a(28) =2639a(29) =2940