login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A306385 a(n) is maximum number of distinct distances possible between points in a hyperrectangular grid the sum of whose dimensions is n. 0

%I

%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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 16 15:56 EDT 2022. Contains 353706 sequences. (Running on oeis4.)