|
|
|
|
#20 by Ray Chandler at Tue Jan 21 13:20:20 EST 2020
|
|
|
|
#19 by Ray Chandler at Tue Jan 21 13:20:14 EST 2020
|
| LINKS
|
Ray Chandler, <a href="/A112680/b112680.txt">Table of n, a(n) for n = 1..10000</a>
|
| STATUS
|
approved
editing
|
|
|
|
#18 by N. J. A. Sloane at Thu Jul 07 23:45:04 EDT 2016
|
| LINKS
|
R. Ron Knott, <a href="http://www.maths.surrey.ac.uk/hosted-sites/R.Knott/Pythag/pythag.html#moregen">Generator of all Pythagorean triples that include a given number</a>
|
|
|
Discussion
|
Thu Jul 07
| 23:45
| OEIS Server: https://oeis.org/edit/global/2530
|
|
|
|
#17 by R. J. Mathar at Fri Dec 13 04:23:29 EST 2013
|
|
|
|
#16 by R. J. Mathar at Fri Dec 13 04:23:17 EST 2013
|
| LINKS
|
AnonymousR. Knott, <a href="http://www.weaver1maths.btinternetsurrey.coac.uk/hosted-sites/theimmortalwombatR.Knott/junkPythag/pythag.html#moregen">Generator of all Pythagorean triples that include a given number</a> [Broken link]>
|
| STATUS
|
approved
editing
|
|
|
|
#15 by Bruno Berselli at Mon Nov 25 03:40:43 EST 2013
|
|
|
|
#14 by Clark Kimberling at Sat Nov 23 13:57:59 EST 2013
|
|
|
|
#13 by Clark Kimberling at Sat Nov 23 13:57:43 EST 2013
|
| COMMENTS
|
Let S consist of integers x such that x is a term of a primitive Pythagorean triple (ppt). Consider the equivalencesequivalence classes induced on S by this relation: x and y are equivalent if some ppt includes both x and y. For each class E, let x(E) be the least number in E. Then (a(n)) is the result of arranging the numbers x(E) in increasing order. The terms of S can be represented as nodes of a disconnected graph whose components match the classes C. For example, the component represented by a(1) = 3 starts with
. . . . . . . . . . . . . . . . . . 3
|
| STATUS
|
proposed
editing
|
|
|
|
#12 by Jon E. Schoenfield at Sat Nov 23 13:27:53 EST 2013
|
|
|
|
#11 by Jon E. Schoenfield at Sat Nov 23 13:27:43 EST 2013
|
|
|
|