A381005
Ordered short legs of the Pythagorean triangles defined by a = 2^(4n) + 2^(2n+1), b = 2^(4n) - 2^(4n-2) - 2^(2n) - 1, c = 2^(4n) + 2^(4n-2) + 2^(2n) + 1.
Original entry on oeis.org
7, 175, 3007, 48895, 785407, 12578815, 201310207, 3221159935, 51539345407, 824632672255, 13194135339007, 211106215755775, 3377699653419007, 54043195260010495, 864691127381393407, 13835058050987196415, 221360928867334750207, 3541774862083514433535, 56668397794160864657407
Offset: 1
- Paolo Xausa, Table of n, a(n) for n = 1..800
- John D. Cook, Sparse binary Pythagorean triples (2025).
- H. S. Uhler, A Colossal Primitive Pythagorean Triangle, The American Mathematical Monthly, Vol. 57, No. 5 (May, 1950), pp. 331-332.
- Wikipedia, Pythagorean triple.
- Index entries for linear recurrences with constant coefficients, signature (21,-84,64).
-
[2^(4*n) - 2^(4*n-2) - 2^(2*n) - 1: n in [1..20]];
-
A381005[n_] := (3*# + 2)*(# - 2)/4 & [4^n]; Array[A381005, 20] (* or *)
LinearRecurrence[{21, -84, 64}, {7, 175, 3007}, 20] (* Paolo Xausa, Feb 26 2025 *)
-
a(n) = 2^(4*n) - 2^(4*n-2) - 2^(2*n) - 1
-
def A381005(n): return ((m:=1<<(n<<1)-1)-1)*(3*m+1) # Chai Wah Wu, Feb 13 2025
A381006
Ordered long legs of the Pythagorean triangles defined by a = 2^(4n) + 2^(2n+1), b = 2^(4n) - 2^(4n-2) - 2^(2n) - 1, c = 2^(4n) + 2^(4n-2) + 2^(2n) + 1.
Original entry on oeis.org
24, 288, 4224, 66048, 1050624, 16785408, 268468224, 4295098368, 68720001024, 1099513724928, 17592194433024, 281475010265088, 4503599761588224, 72057594574798848, 1152921506754330624, 18446744082299486208, 295147905213712564224, 4722366483007084167168
Offset: 1
- Paolo Xausa, Table of n, a(n) for n = 1..800
- John D. Cook, Sparse binary Pythagorean triples (2025).
- H. S. Uhler, A Colossal Primitive Pythagorean Triangle, The American Mathematical Monthly, Vol. 57, No. 5 (May, 1950), pp. 331-332.
- Wikipedia, Pythagorean triple.
- Index entries for linear recurrences with constant coefficients, signature (20,-64).
-
[2^(4*n) + 2^(2*n+1): n in [1..20]];
-
A381006[n_] := #*(# + 2) & [4^n]; Array[A381006, 20] (* or *)
LinearRecurrence[{20, -64}, {24, 288}, 20] (* Paolo Xausa, Feb 26 2025 *)
-
a(n) = 2^(4*n) + 2^(2*n+1)
-
def A381006(n): return (m:=1<<(n<<1))*(m+2) # Chai Wah Wu, Feb 13 2025
A381007
Ordered hypotenuses of the Pythagorean triangles defined by a = 2^(4n) + 2^(2n+1), b = 2^(4n) - 2^(4n-2) - 2^(2n) - 1, c = 2^(4n) + 2^(4n-2) + 2^(2n) + 1.
Original entry on oeis.org
25, 337, 5185, 82177, 1311745, 20975617, 335560705, 5368774657, 85899608065, 1374390583297, 21990236749825, 351843737665537, 5629499601321985, 90071992815845377, 1441151881832300545, 23058430096431906817, 368934881491370901505, 5902958103655775993857
Offset: 1
- Paolo Xausa, Table of n, a(n) for n = 1..800
- John D. Cook, Sparse binary Pythagorean triples (2025).
- H. S. Uhler, A Colossal Primitive Pythagorean Triangle, The American Mathematical Monthly, Vol. 57, No. 5 (May, 1950), pp. 331-332.
- Wikipedia, Pythagorean triple.
- Index entries for linear recurrences with constant coefficients, signature (21,-84,64).
-
[2^(4*n) + 2^(4*n-2) + 2^(2*n) + 1: n in [1..20]];
-
A381007[n_] := 5*4^(2*n - 1) + 4^n + 1; Array[A381007, 20] (* or *)
LinearRecurrence[{21, -84, 64}, {25, 337, 5185}, 20] (* Paolo Xausa, Feb 26 2025 *)
-
a(n) = 2^(4*n) + 2^(4*n-2) + 2^(2*n) + 1
-
def A381007(n): return (m:=1<<(n<<1)-1)*(5*m+2)+1 # Chai Wah Wu, Feb 13 2025
A381008
Ordered perimeters of the Pythagorean triangles defined by a = 2^(4n) + 2^(2n+1), b = 2^(4n) - 2^(4n-2) - 2^(2n) - 1, c = 2^(4n) + 2^(4n-2) + 2^(2n) + 1.
Original entry on oeis.org
56, 800, 12416, 197120, 3147776, 50339840, 805339136, 12885032960, 206158954496, 3298536980480, 52776566521856, 844424963686400, 13510799016329216, 216172782650654720, 3458764515968024576, 55340232229718589440, 885443715572418215936, 14167099448746374594560
Offset: 1
- Paolo Xausa, Table of n, a(n) for n = 1..800
- John D. Cook, Sparse binary Pythagorean triples (2025).
- H. S. Uhler, A Colossal Primitive Pythagorean Triangle, The American Mathematical Monthly, Vol. 57, No. 5 (May, 1950), pp. 331-332.
- Wikipedia, Pythagorean triple.
- Index entries for linear recurrences with constant coefficients, signature (20,-64).
-
[2^(4*n+1) + 2^(2*n+1) + 2^(4*n): n in [1..20]];
-
A381008[n_] := #*(3*# + 2) & [4^n]; Array[A381008, 20] (* or *)
LinearRecurrence[{20, -64}, {56, 800}, 20] (* Paolo Xausa, Feb 26 2025 *)
-
a(n) = 2^(4*n+1) + 2^(2*n+1) + 2^(4*n)
-
def A381008(n): return (m:=1<<(n<<1))*(2+3*m) # Chai Wah Wu, Feb 13 2025
Showing 1-4 of 4 results.
Comments