An upper bound on the biplanar crossing number of the complete graph on n nodes.

Terms

a(0) =0a(1) =0a(2) =0a(3) =0a(4) =0a(5) =0a(6) =0a(7) =0a(8) =4a(9) =7a(10) =12a(11) =18a(12) =37a(13) =53a(14) =75a(15) =100a(16) =152a(17) =198a(18) =256a(19) =320a(20) =430a(21) =530a(22) =650a(23) =780a(24) =980a(25) =1165a(26) =1380a(27) =1610a(28) =1939a(29) =2247