Maximal number of edges in Hamiltonian path in complete graph on n nodes.

Terms

a(0) =0a(1) =1a(2) =3a(3) =5a(4) =10a(5) =13a(6) =21a(7) =25a(8) =36a(9) =41a(10) =55a(11) =61a(12) =78a(13) =85a(14) =105a(15) =113a(16) =136a(17) =145a(18) =171a(19) =181a(20) =210a(21) =221a(22) =253a(23) =265a(24) =300a(25) =313a(26) =351a(27) =365a(28) =406a(29) =421