cp's OEIS Frontend

A306385 a(n) is the maximum number of distinct distances possible between points in a hyperrectangular grid the sum of whose dimensions is n.

%I A306385 #39 Sep 25 2024 11:24:15
%S A306385 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 A306385 181,199,217,238,261,284,309,338,368,398,428,458,488,518,555,592,631,
%U A306385 673,715,757,804,852,900,948,997,1052,1107,1163,1222,1281,1340,1407,1474,1541,1608,1675
%N A306385 a(n) is the maximum number of distinct distances possible between points in a hyperrectangular grid the sum of whose dimensions is n.
%H A306385 Lorraine Lee, <a href="https://gitlab.com/n8chz/distinct-distances/blob/master/spes.rb">Ruby program which generates the sequence</a>
%o A306385 (PARI)
%o A306385 b(v)={prod(k=1, #v, sum(i=0, v[k]-1, x^(i^2)))}
%o A306385 c(v)={sum(i=1, #v, v[i]<>0)}
%o A306385 a(n)={my(m=1); if(n>1, forpart(p=n, m=max(m, c(Vec(b(p)))), [2,n])); m} \\ _Andrew Howroyd_, Aug 11 2024
%K A306385 nonn
%O A306385 1,2
%A A306385 _Lorraine Lee_, Feb 20 2019
%E A306385 a(44)-a(45) from _Lorraine Lee_, Aug 11 2024
%E A306385 a(46) onwards from _Andrew Howroyd_, Aug 11 2024