A145046 -id:A145046 - cp's OEIS frontend

A145045 Primes p (A000043) such that 2^p-1 is prime (A000668) and congruent to 607 mod 6!

107, 86243, 756839, 25964951, 37156667

Offset: 1

Artur Jasinski, Sep 30 2008

nonn

Mersenne numbers (with the exception of the first two) are congruent to 31, 127, 271, 607 mod 6!. This sequence is a subset of A000043.

Cf. A000043, A000668, A124477, A139484, A145038, A112633, A145041, A145042, A145044, A145045, A145046.

p = {2, 3, 5, 7, 13, 17, 19, 31, 61, 89, 107, 127, 521, 607, 1279, 2203, 2281, 3217, 4253, 4423, 9689, 9941, 11213, 19937, 21701, 23209, 44497, 86243, 110503, 132049, 216091, 756839, 859433, 1257787, 1398269, 2976221, 3021377, 6972593, 13466917, 20996011, 24036583, 25964951, 30402457, 32582657, 37156667, 43112609}; a = {}; Do[If[Mod[2^p[[n]] - 1, 6! ] == 607, AppendTo[a, p[[n]]]], {n, 1, Length[p]}]; a (*Artur Jasinski*)

Comment rewritten by Harvey P. Dale, Sep 02 2023

A145010 a(n) = area of Pythagorean triangle with hypotenuse p, where p = A002144(n) = n-th prime == 1 (mod 4).

Original entry on oeis.org

6, 30, 60, 210, 210, 180, 630, 330, 1320, 1560, 2340, 990, 2730, 840, 4620, 3570, 5610, 4290, 1710, 7980, 2730, 6630, 10920, 12540, 4080, 8970, 14490, 18480, 9690, 3900, 11550, 25200, 26910, 30600, 34650, 32130, 37050, 7980, 23460, 6090, 29580, 49140, 35700

Offset: 1

M. F. Hasler, Feb 24 2009

nonn

Pythagorean primes, i.e., primes of the form p = 4k+1 = A002144(n), have exactly one representation as sum of two squares: A002144(n) = x^2+y^2 = A002330(n+1)^2+A002331(n+1)^2. The corresponding (primitive) integer-sided right triangle with sides { 2xy, |x^2-y^2| } = { A002365(n), A002366(n) } has area xy|x^2-y^2| = a(n). For n>1 this is a(n) = 30*A068386(n).

			The following table shows the relationship between several closely related sequences:
Here p = A002144 = primes == 1 (mod 4), p = a^2+b^2 with a < b;
a = A002331, b = A002330, t_1 = ab/2 = A070151;
p^2 = c^2+d^2 with c < d; c = A002366, d = A002365,
t_2 = 2ab = A145046, t_3 = b^2-a^2 = A070079,
with {c,d} = {t_2, t_3}, t_4 = cd/2 = ab(b^2-a^2).
  ---------------------------------
   p  a  b  t_1  c   d t_2 t_3  t_4
  ---------------------------------
   5  1  2   1   3   4   4   3    6
  13  2  3   3   5  12  12   5   30
  17  1  4   2   8  15   8  15   60
  29  2  5   5  20  21  20  21  210
  37  1  6   3  12  35  12  35  210
  41  4  5  10   9  40  40   9  180
  53  2  7   7  28  45  28  45  630

T. D. Noe, Table of n, a(n) for n = 1..1000

Cf. A002144, A002365, A002366, A144954.

Reap[For[p = 2, p < 500, p = NextPrime[p], If[Mod[p, 4] == 1, area = x*y/2 /. ToRules[Reduce[0 < x <= y && p^2 == x^2 + y^2, {x, y}, Integers]]; Sow[area]]]][[2, 1]] (* Jean-François Alcover, Feb 04 2015 *)

forprime(p=1,499, p%4==1 | next; t=[p,lift(-sqrt(Mod(-1,p)))]; while(t[1]^2>p,t=[t[2],t[1]%t[2]]); print1(t[1]*t[2]*(t[1]^2-t[2]^2)","))

{Q=Qfb(1,0,1);forprime(p=1,499,p%4==1|next;t=qfbsolve(Q,p); print1(t[1]*t[2]*(t[1]^2-t[2]^2)","))} \\ David Broadhurst

a(n) = A002365(n)*A002366(n)/2.

a(n) = x*y*(x^2-y^2), where x = A002330(n+1), y = A002331(n+1).

A145019 A002330(n)*A002331(n).

Original entry on oeis.org

1, 2, 6, 4, 10, 6, 20, 14, 30, 24, 40, 36, 10, 30, 56, 44, 70, 66, 26, 90, 84, 14, 30, 104, 60, 16, 130, 126, 80, 34, 156, 154, 144, 90, 136, 126, 170, 114, 20, 60, 210, 204, 140, 84, 190, 110, 220, 210, 266, 260, 24, 184, 120, 306, 304, 100, 286, 150, 276, 26, 130, 330, 54, 234

Offset: 0

N. J. A. Sloane, Feb 25 2009

nonn

Apart from initial term, twice A070151, or half A145046.

cp's OEIS Frontend

A145045 Primes p (A000043) such that 2^p-1 is prime (A000668) and congruent to 607 mod 6!

Views

Author

Keywords

Comments

Crossrefs

Programs

Mathematica

Extensions

A145010 a(n) = area of Pythagorean triangle with hypotenuse p, where p = A002144(n) = n-th prime == 1 (mod 4).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

PARI

Formula

A145019 A002330(n)*A002331(n).

Views

Author

Keywords

Crossrefs