The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A007543 Frequency of n-th largest distance in N times N grid, N > n. (Formerly M1826) 2
 2, 8, 12, 8, 16, 24, 20, 32, 18, 24, 40, 48, 28, 48, 60, 32, 32, 56, 72, 80, 36, 64, 84, 96, 50, 40, 72, 96, 112, 120, 44, 80, 108, 128, 140, 72, 48, 88, 120, 144, 160, 168, 52, 96, 132, 160, 180, 192, 98, 56, 104, 144, 176, 200, 216, 224, 60 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 REFERENCES V. Reddy and S. Skiena, Frequencies of large distances in integer lattices, in Graph theory, combinatorics and algorithms, Vol. 1, 2 (Kalamazoo, MI, 1992), 981-989, Wiley-Intersci. Publ., Wiley, New York, 1995. N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). LINKS S. Skiena, Email to N. J. A. Sloane, Jun. 1994 FORMULA a(n) = 2 * n if n is a perfect square, otherwise a(n) = 4 * (n - f(n)) * (ceiling(2 * sqrt(n)) - n + f(n)) where f(n) = floor(floor(2 * sqrt(n))^2 / 4) [from Reddy and Skiena]. - Sean A. Irvine, Jan 08 2018 CROSSREFS Cf. A007544. Sequence in context: A209429 A135132 A178060 * A171620 A043377 A107629 Adjacent sequences:  A007540 A007541 A007542 * A007544 A007545 A007546 KEYWORD nonn AUTHOR EXTENSIONS More terms from Sean A. Irvine, Jan 08 2018 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.

Last modified June 15 22:06 EDT 2021. Contains 345053 sequences. (Running on oeis4.)