Dudley triangle

In mathematics, the Dudley triangle is a triangular array of integers that was defined by Underwood Dudley (1987). It consists of the numbers

(sequence A036238 in the OEIS).
Dudley Triangle may also refer to a neighborhood of Boston, Massachusetts.

Dudley exhibited several rows of this triangle, and challenged readers to find the next row; the challenge was met by J. G. Mauldon, who proposed two different solutions. In one of Mauldon's solutions, the number at the intersection of the mth and nth diagonals (counting the top of the triangle as having m = n = 1) is given by the formula[1]

Notes
  1. Pickover (2003).
gollark: t!speed
gollark: I could make a program which constantly checks the clipboard for performance reasons.
gollark: Although I can outtype most people on my laptop anyway sso I don't particularly need it.
gollark: I stole the code from lyric's git repo for the English typerace and inverted it.
gollark: Orbit is one of my favourite … locations? Sets of locations? Sets of *momenta*?

References
  • Dudley, Underwood (1987). "Problem 1277". Mathematics Magazine. 60 (5): 328. JSTOR 2690418.CS1 maint: ref=harv (link)
  • Mauldon, J. G. (1988). "Solution to problem 1277". Mathematics Magazine. 61 (5): 316. JSTOR 2689553.
  • Pickover, Clifford A. (2003). "Chapter 59. The Dudley Triangle". Wonders of Numbers: Adventures in Mathematics, Mind, and Meaning. Oxford University Press. pp. 144–145. ISBN 978-0-19-515799-4.CS1 maint: ref=harv (link)


This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.