|
%I #26 Mar 08 2019 18:10:32
%S 1,2,3,4,5,7,9,12,15,18,23,28,33,40,47,56,65,74,85,98,111,127,145,163,
%T 181,199,217,238,261,284,309,338,368,398,428,458,488,518,555,592,631,
%U 673,715
%N a(n) is maximum number of distinct distances possible between points in a hyperrectangular grid the sum of whose dimensions is n.
%H Lorraine Lee, <a href="https://gitlab.com/n8chz/distinct-distances/blob/master/spes.rb">Ruby program which generates the sequence</a>
%K nonn,more
%O 1,2
%A _Lorraine Lee_, Feb 20 2019
|
