login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons 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
1, 2, 3, 4, 5, 7, 9, 12, 15, 18, 23, 28, 33, 40, 47, 56, 65, 74, 85, 98, 111, 127, 145, 163, 181, 199, 217, 238, 261, 284, 309, 338, 368, 398, 428, 458, 488, 518, 555, 592, 631, 673, 715 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..43.

Lorraine Lee, Ruby program which generates the sequence

CROSSREFS

Sequence in context: A030741 A190269 A304632 * A039853 A062188 A122129

Adjacent sequences:  A306382 A306383 A306384 * A306386 A306387 A306388

KEYWORD

nonn,more

AUTHOR

Lorraine Lee, Feb 20 2019

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 23 16:00 EST 2020. Contains 332171 sequences. (Running on oeis4.)