A080175 -id:A080175 - cp's OEIS frontend

A080176 Generalized Fermat numbers: 10^(2^n) + 1, n >= 0.

11, 101, 10001, 100000001, 10000000000000001, 100000000000000000000000000000001, 10000000000000000000000000000000000000000000000000000000000000001

Offset: 0

Jens Voß, Feb 04 2003

As for standard Fermat numbers 2^(2^n) + 1, a number (2b)^m + 1 (with b > 1) can only be prime if m is a power of 2. On the other hand, out of the first 12 base-10 Fermat numbers, only the first two are primes.

Also, binary representation of Fermat numbers (in decimal, see A000215).

			a(0) = 10^1 + 1 = 11 = 9*(1) + 2 = 9*(empty product) + 2.
a(1) = 10^2 + 1 = 101 = 9*(11) + 2.
a(2) = 10^4 + 1 = 10001 = 9*(11*101) + 2.
a(3) = 10^8 + 1 = 100000001 = 9*(11*101*10001) + 2.
a(4) = 10^16 + 1 = 10000000000000001 = 9*(11*101*10001*100000001) + 2.
a(5) = 10^32 + 1 = 100000000000000000000000000000001 = 9*(11*101*10001*100000001*10000000000000001) + 2.

Vincenzo Librandi, Table of n, a(n) for n = 0..9 (shortened by _N. J. A. Sloane_, Jan 13 2019)
Anders Björn and Hans Riesel, Factors of Generalized Fermat Numbers, Mathematics of Computation, Vol. 67, No. 221, Jan., 1998, pp. 441-446.
C. K. Caldwell, "Top Twenty" page, Generalized Fermat Divisors (base=10).
Wilfrid Keller, GFN10 factoring status.
Romeo Meštrović, Euclid's theorem on the infinitude of primes: a historical survey of its proofs (300 BC--2012) and another new proof, arXiv preprint arXiv:1202.3670, 2012 - From N. J. A. Sloane, Jun 13 2012
Eric Weisstein's World of Mathematics, Generalized Fermat Number.
OEIS Wiki, Generalized Fermat numbers.

Cf. A000215 (Fermat numbers: 2^(2^n) + 1, n >= 0).

Cf. A019434, A080174, A080175, A059919, A199591, A078303, A078304, A152581, A199592, A152585.

[10^(2^n) + 1: n in [0..8]]; // Vincenzo Librandi, Jun 20 2011

Table[10^2^n + 1, {n, 0, 6}] (* Arkadiusz Wesolowski, Nov 02 2012 *)

a(0) = 11; a(n) = (a(n - 1) - 1)^2 + 1.
a(n) = 9*a(n-1)*a(n-2)*...*a(1)*a(0) + 2, n >= 0, where for n = 0, we get 9*(empty product, i.e., 1)+ 2 = 11 = a(0). - Daniel Forgues, Jun 20 2011
Sum_{n>=0} 2^n/a(n) = 1/9. - Amiram Eldar, Oct 03 2022

Edited by Daniel Forgues, Jun 19 2011

A080109 Square of primes of the form 4k+1 (A002144).

Original entry on oeis.org

25, 169, 289, 841, 1369, 1681, 2809, 3721, 5329, 7921, 9409, 10201, 11881, 12769, 18769, 22201, 24649, 29929, 32761, 37249, 38809, 52441, 54289, 58081, 66049, 72361, 76729, 78961, 85849, 97969, 100489, 113569, 121801, 124609, 139129

Offset: 1

Cino Hilliard, Mar 16 2003

a(n) is the sum of two positive squares in only one way. See the Dickson reference, (B) p. 227.
a(n) is the hypotenuse of two and only two right triangles with integral legs (modulo leg exchange). See the Dickson reference, (A) p. 227.
In 1640 Fermat generalized the 3,4,5 triangle with the theorem: A prime of the form 4n+1 is the hypotenuse of one and only one right triangle with integral arms. The square of a prime of the form 4n+1 is the hypotenuse of two and only two... The cube of three and only three...

			a(7) = 2809 is the hypotenuse of triangles 1241, 2520, 2809 and 1484, 2385, 2809, and only of these.
a(7) = 53^2 = 2809 = 45^2 + (4*7)^2, and this is the only way. - _Wolfdieter Lang_, Jan 13 2015

L. E. Dickson, History of the Theory of Numbers, Volume II, Diophantine Analysis. Carnegie Institution Publ. No. 256, Vol II, Washington, DC, 1920, p. 227.
Morris Kline, Mathematical Thought from Ancient to Modern Times, 1972, pp. 275-276.

Amiram Eldar, Table of n, a(n) for n = 1..10000
Jorma K. Merikoski, Pentti Haukkanen, and Timo Tossavainen, The congruence x^n = -a^n (mod m): Solvability and related OEIS sequences, Notes. Num. Theor. Disc. Math. (2024) Vol. 30, No. 3, 516-529. See p. 521.

Cf. A002144, A080175. - Wolfdieter Lang, Jan 13 2015

Cf. A070079, A070151, A088539, A243380.

Select[4 Range[96] + 1, PrimeQ]^2 (* Michael De Vlieger, Dec 27 2016 *)

fermat(n) = { for(x=1,n, y=4*x+1; if(isprime(y),print1(y^2" ")) ) }

a(n) = A002144(n)^2 = A070079(n)^2 + (4*A070151(n))^2, for n >= 1. - Wolfdieter Lang, Jan 13 2015
From Amiram Eldar, Dec 02 2022: (Start)
Product_{n>=1} (1 + 1/a(n)) = A243380
Product_{n>=1} (1 - 1/a(n)) = A088539. (End)

Edited: Name changed, part of old name as comment. Comments added and changed. Dickson reference added. - Wolfdieter Lang, Jan 13 2015

A253802 a(n) gives the odd leg of one of the two Pythagorean triangles with hypotenuse A080109(n) = A002144(n)^2. This is the smaller of the two possible odd legs.

Original entry on oeis.org

7, 65, 161, 41, 1081, 369, 1241, 671, 721, 3471, 959, 9401, 4681, 1695, 3281, 7599, 10199, 24521, 3439, 18335, 37241, 45241, 24465, 29281, 64001, 18561, 31855, 27761, 76601, 7825

Offset: 1

Wolfdieter Lang, Jan 14 2015

The corresponding even legs are given in 4*A253803.
The legs of the other Pythagorean triangle with hypotenuse A080109(n) are given A253804(n) (odd) and A253805(n) (even).
Each fourth power of a prime of the form 1 (mod 4) (see A002144(n)^2 = A080175(n)) has exactly two representations as sum of two positive squares (Fermat). See the Dickson reference, (B) on p. 227.
This means that there are exactly two Pythagorean triangles (modulo leg exchange) for each hypotenuse A080109(n) = A002144(n)^2, n >= 1. See the Dickson reference, (A) on p. 227.
Note that the Pythagorean triangles are not always primitive. E.g., n = 2: (65, 4*39, 13^2) = 13*(5, 4*3, 13). For each prime congruent 1 (mod 4) (A002144) there is one and only one such non-primitive triangle with hypotenuse p^2 (just scale the unique primitive triangle with hypotenuse p with the factor p). Therefore, one of the two existing Pythagorean triangles with hypotenuse from A080109 is primitive and the other is imprimitive.

			n = 7: A080175(7) = 7890481 = 53^4 = 2809^2; A002144(7)^4  =  a(7)^2 + (4*A253803(7))^2 = 1241^2 + (4*630)^2.
The other Pythagorean triangle with hypotenuse 53^2 = 2809 has odd leg A253804(7) = 2385 and even leg 4*A253305(7) = 4*371 = 1484: 53^4 = 2385^2 + (4*371)^2.

L. E. Dickson, History of the Theory of Numbers, Carnegie Institution, Publ. No. 256, Vol. II, Washington D.C., 1920, p. 227.

Cf. A002144, A002972, A002973, A070079, A070151, A080109, A253305, A253803, A253804.

A080175(n) = A002144(n)^4 = a(n)^2 + (4*A253803(n))^2,
n >= 1, that is,
a(n) = sqrt(A080175(n) - (4*A253803(n))^2), n >= 1.

A253803 a(n) gives one fourth of the even leg of one of the two Pythagorean triangles with hypotenuse A080109(n) = A002144(n)^2. The odd leg is given in A253802(n).

Original entry on oeis.org

6, 39, 60, 210, 210, 410, 630, 915, 1320, 1780, 2340, 990, 2730, 3164, 4620, 5215, 5610, 4290, 8145, 8106, 2730, 6630, 12116, 12540, 4080, 17485, 17451, 18480, 9690, 24414

Offset: 1

Wolfdieter Lang, Jan 14 2015

See A253802 for comments and the Dickson reference.

			n = 7: A080175(7) = 7890481 = 53^4 = 2809^2; A002144(7)^4 = A253802(7)^2 + (4*a(7))^2 = 1241^2 + (4*630)^2.
The other Pythagorean triangle with hypotenuse
53^2 = 2809 has odd leg A253804(7) = 2385 and even leg 4*A253305(7) = 4*371 = 1484: 53^4 = 2385^2 + (4*371)^2.

L. E. Dickson, History of the Theory of Numbers, Carnegie Institution, Publ. No. 256, Vol. II, Washington D.C., 1920, p. 227.

Cf. A002144, A080109, A253802, A253804, A253805.

a(n) = sqrt(A080109(n)^2 - A253802(n)^2)/4, n >= 1.

A253804 a(n) gives the odd leg of the second of the two Pythagorean triangles with hypotenuse A080109(n) = A002144(n)^2. This is the larger of the two possible odd legs.

Original entry on oeis.org

15, 119, 255, 609, 1295, 1519, 2385, 3479, 4015, 4879, 6305, 9999, 9919, 12319, 14385, 16999, 13345, 28545, 32039, 19199, 38415, 50609, 32239, 50369, 65535, 62839, 50279, 64911, 83505, 96719

Offset: 1

Wolfdieter Lang, Jan 16 2015

The corresponding even legs are given in 4*A253805.
The legs of the other Pythagorean triangle with hypotenuse A080109(n) are given A253802(n) (odd) and A253803(n) (even).
Each fourth power of a prime of the form 1 (mod 4) (see A002144(n)^= A080175(n)) has exactly two representations as sum of two positive squares (Fermat). See the Dickson reference, (B) on p. 227.
This means that there are exactly two Pythagorean triangles (modulo leg exchange) for each hypotenuse A080109(n) = A002144(n)^2, n >= 1. See the Dickson reference, (A) on p. 227.
Concerning the primitivity question of these triangles see a comment on A253802.

			n = 7: A080175(7) = 7890481 = 53^4 = 2809^2; A002144(7)^4 = a(7)^2 + (4*A253805(7))^2 = 2385^2 + (4*371)^2.
The other Pythagorean triangle with hypotenuse 53^2 = 2809 has odd leg A253802(7) = 1241 and even leg 4*A253303(7) = 4*630 = 2520: 53^4 = 1241^2 + (4*630)^2.

L. E. Dickson, History of the Theory of Numbers, Carnegie Institution, Publ. No. 256, Vol. II, Washington D.C., 1920, p. 227.

Cf. A002144, A002972, A002973, A070079, A070151, A080109, A253303, A253802, A253805.

A080175(n) = A002144(n)^4 = a(n)^2 + (4*A253805(n))^2,
n >= 1, that is,
a(n) = sqrt(A080175(n) - (4*A253805(n))^2), n >= 1.

A253805 a(n) gives one fourth of the even leg of the second of the two Pythagorean triangles with hypotenuse A080109(n) = A002144(n)^2. The odd leg is given in A253804.

Original entry on oeis.org

5, 30, 34, 145, 111, 180, 371, 330, 876, 1560, 1746, 505, 1635, 840, 3014, 3570, 5181, 2249, 1710, 7980, 1379, 3435, 10920, 7230, 2056, 8970, 14490, 11240, 4981, 3900

Offset: 1

Wolfdieter Lang, Jan 16 2015

See A253804 for comments and the Dickson reference.

			n = 7: A080175(7) = 7890481 = 53^4 = 2809^2; A002144(7)^4 = A253804(7)^2 + (4*a(7))^2 = 2385^2 + (4*371)^2.
The other Pythagorean triangle with hypotenuse 53^2 = 2809 has odd leg A253802(7) = 1241 and even leg 4*A253303(7) = 4*630 = 2520: 53^4 = 1241^2 + (4*630)^2.

L. E. Dickson, History of the Theory of Numbers, Carnegie Institution, Publ. No. 256, Vol. II, Washington D.C., 1920, p. 227.

Cf. A002144, A080109, A253804, A253802, A253803.

a(n) = sqrt(A080109(n)^2 - A253804(n)^2)/4, n >= 1.

A080169 Numbers that are cubes of primes of the form 4k+1 (A002144).

Original entry on oeis.org

125, 2197, 4913, 24389, 50653, 68921, 148877, 226981, 389017, 704969, 912673, 1030301, 1295029, 1442897, 2571353, 3307949, 3869893, 5177717, 5929741, 7189057, 7645373, 12008989, 12649337, 13997521, 16974593, 19465109, 21253933

Offset: 1

Cino Hilliard, Mar 16 2003

a(n) is the sum of two squares in exactly two ways (Fermat). See the Dickson reference, (B) on p. 277. - Wolfdieter Lang, Jan 15 2015
a(n) is the hypotenuse of three and only three right triangles with integral arms.
In 1640 Fermat generalized the 3,4,5 triangle with the theorem: A prime of the form 4n+1 is the hypotenuse of one and only one right triangle with integral arms. The square of a prime of the form 4n+1 is the hypotenuse of two and only two... The cube of three and only three... .
  See the Dickson reference, (A) on p. 227.

			a(2) = 2197 is the hypotenuse of the three triangles 825, 2035, 2197; 845, 2028, 2197; 1547, 1560, 2197.
a(2) = 9^2 + 46^2  = 39^2 + 26^2, and these are the only decompositions. - _Wolfdieter Lang_, Jan 15 2015

L. E. Dickson, History of the Theory of Numbers, Carnegie Institution, Publ. No. 256, Vol. II, Washington D.C., 1920, p. 227.
Morris Kline, Mathematical Thought from Ancient to Modern Times, 1972, pp. 275-276.

Amiram Eldar, Table of n, a(n) for n = 1..10000

Cf. A002144, A080109, A080175, A334425.

Select[Prime[Range[60]], Mod[#, 4] == 1 &]^3 (* Amiram Eldar, Dec 02 2022 *)

fermat(n) = { for(x=1,n, y=4*x+1; if(isprime(y),print1(y^3" ")) ) }

a(n) = A002144(n)^3, n >= 1.

Product_{n>=1} (1 - 1/a(n)) = A334425. - Amiram Eldar, Dec 02 2022

Edited: New name, part of old one now as a comment. Dickson reference, formula and cross references added. - Wolfdieter Lang, Jan 15 2015

cp's OEIS Frontend

A080176 Generalized Fermat numbers: 10^(2^n) + 1, n >= 0.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Mathematica

Formula

Extensions

A080109 Square of primes of the form 4k+1 (A002144).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A253802 a(n) gives the odd leg of one of the two Pythagorean triangles with hypotenuse A080109(n) = A002144(n)^2. This is the smaller of the two possible odd legs.

Views

Author

Keywords

Comments

Examples

References

Crossrefs

Formula

A253803 a(n) gives one fourth of the even leg of one of the two Pythagorean triangles with hypotenuse A080109(n) = A002144(n)^2. The odd leg is given in A253802(n).

Views

Author

Keywords

Comments

Examples

References

Crossrefs

Formula

A253804 a(n) gives the odd leg of the second of the two Pythagorean triangles with hypotenuse A080109(n) = A002144(n)^2. This is the larger of the two possible odd legs.

Views

Author

Keywords

Comments

Examples

References

Crossrefs

Formula

A253805 a(n) gives one fourth of the even leg of the second of the two Pythagorean triangles with hypotenuse A080109(n) = A002144(n)^2. The odd leg is given in A253804.

Views

Author

Keywords

Comments

Examples

References

Crossrefs

Formula

A080169 Numbers that are cubes of primes of the form 4k+1 (A002144).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions