proposed
approved
proposed
approved
editing
proposed
Also 1/7 of the area of the n-th largest octagon with angles 3*Pi/4, along the perimeter of which there are only 8 nodes of the square lattice - at its vertices. - _Alexander M. Domashenko_, Feb 21 2024
perimeter of which there are only 8 nodes of the square lattice - at its
vertices. - Alexander M. Domashenko, Feb 21 2024
proposed
editing
editing
proposed
Numbers k such that there is a "knight's move" of Euclidean distance sqrt(k) which allows the whole of the 2D lattice to be reached. For example, a knight which travels 4 units in any direction and then 1 unit at right angles to the first direction moves a distance sqrt(17) for each move. This knight can reach every square of an infinite chessboard. Also 1/7 of the area of the n-th largest octagon with angles 3*Pi/4, along the
Also 1/7 of the area of the n-th largest octagon with angles 3*Pi/4, along the
vertices. -_ _Alexander M. Domashenko_, Feb 21 2024
proposed
editing
editing
proposed
Numbers k such that there is a "knight's move" of Euclidean distance sqrt(k) which allows the whole of the 2D lattice to be reached. For example, a knight which travels 4 units in any direction and then 1 unit at right angles to the first direction moves a distance sqrt(17) for each move. This knight can reach every square of an infinite chessboard. Also 1/7 of the area of the n-th largest octagon with angles 3*Pi/4, along the
1/7 perimeter of the area which there are only 8 nodes of the nsquare lattice -th largest octagon with angles 3*Pi/4, along the at its
perimeter of which there are only 8 nodes of the square lattice - at its
vertices.-Alexander M. Domashenko, Feb 21 2024
Numbers k such that there is a "knight's move" of Euclidean distance sqrt(k) which allows the whole of the 2D lattice to be reached. For example, a knight which travels 4 units in any direction and then 1 unit at right angles to the first direction moves a distance sqrt(17) for each move. This knight can reach every square of an infinite chessboard. Also
1/7 of the area of the n-th largest octagon with angles 3*Pi/4, along the
perimeter of which there are only 8 nodes of the square lattice - at its
vertices.-Alexander M. Domashenko, Feb 21 2024
approved
editing
Also gives solutions z to x^2+y^2=z^4 with gcd(x,y,z)=1 and x,y,z positive. - John Sillcox (johnsillcox(AT)hotmail.com), Feb 20 2004A065338(a(n)) = 1. - Reinhard Zumkeller, Jul 10 2010Product_{k=1..A001221(a(n))} A079260(A027748(a(n),k)) = 1. - Reinhard Zumkeller, Jan 07 2013A062327(a(n)) = A000005(a(n))^2. (These are the only numbers that satisfy this equation.) - Benedikt Otten, May 22 2013Numbers that are positive integer divisors of 1 + 4*x^2 where x is a positive integer. - Michael Somos, Jul 26 2013
Also gives solutions z to x^2+y^2=z^4 with gcd(x,y,z)=1 and x,y,z positive. - John Sillcox (johnsillcox(AT)hotmail.com), Feb 20 2004
A065338(a(n)) = 1. - Reinhard Zumkeller, Jul 10 2010
Product_{k=1..A001221(a(n))} A079260(A027748(a(n),k)) = 1. - Reinhard Zumkeller, Jan 07 2013
A062327(a(n)) = A000005(a(n))^2. (These are the only numbers that satisfy this equation.) - Benedikt Otten, May 22 2013
Numbers that are positive integer divisors of 1 + 4*x^2 where x is a positive integer. - Michael Somos, Jul 26 2013
Also 1/7 of the area of the n-th largest octagon with
angles 3*Pi/4, along the perimeter of which there are only 8 nodes of the
square lattice - at its vertices.-Alexander M. Domashenko, Feb 12 2024
nonn,nice,easy,changed
proposed
approved
editing
proposed