A002334
Least positive integer x such that prime A038873(n) = x^2 - 2y^2 for some y.
Original entry on oeis.org
2, 3, 5, 5, 7, 7, 7, 11, 9, 9, 11, 13, 11, 11, 15, 13, 13, 13, 17, 15, 19, 15, 19, 17, 21, 17, 19, 17, 17, 19, 21, 25, 19, 19, 23, 25, 23, 21, 23, 21, 21, 29, 23, 25, 23, 27, 29, 23, 31, 33, 25, 29, 27, 25, 25, 27, 29, 35, 31, 31, 27, 29, 33, 31, 29, 29, 29, 29, 37, 31, 41, 35
Offset: 1
The first solutions [x(n), y(n)] are (the prime is given as first entry): [2,[2,1]], [7,[3,1]], [17,[5,2]], [23,[5,1]], [31,[7,3]], [41,[7,2]], [47,[7,1]], [71,[11,5]], [73,[9,2]], [79,[9,1]], [89,[11,4]], [97,[13,6]], [103,[11,3]], [113,[11,2]], [127,[15,7]], [137,[13,4]], [151,[13,3]], [167,[13,1]], [191,[17,7]], [193,[15,4]], [199,[19,9]], [223,[15,1]], [233,[19,8]], [239,[17,5]], [241,[21,10]], [257,[17,4]], [263,[19,7]], [271,[17,3]], ... - _Wolfdieter Lang_, Feb 17 2015
- A. J. C. Cunningham, Quadratic Partitions. Hodgson, London, 1904, p. 1.
- D. H. Lehmer, Guide to Tables in the Theory of Numbers. Bulletin No. 105, National Research Council, Washington, DC, 1941, p. 55.
- N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
- N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
-
with(numtheory): readlib(issqr): for i from 1 to 250 do p:=ithprime(i): pmod8:=modp(p,8): if p=2 or pmod8=1 or pmod8=7 then for y from 1 do x2:=p+2*y^2: if issqr(x2) then printf("%d,",sqrt(x2)): break fi od fi od: # Pab Ter, May 08 2004
-
maxPrimePi = 200;
Reap[Do[If[MatchQ[Mod[p, 8], 1|2|7], rp = Reduce[x > 0 && y > 0 && p == x^2 - 2*y^2, {x, y}, Integers]; If[rp =!= False, xy = {x, y} /. {ToRules[rp /. C[1] -> 1]}; x0 = xy[[All, 1]] // Min // Simplify; Print[{p, xy[[1]]} ]; Sow[x0]]], {p, Prime[Range[maxPrimePi]]}]][[2, 1]] (* Jean-François Alcover, Oct 27 2019 *)
More terms from Pab Ter (pabrlos(AT)yahoo.com), May 08 2004
The name has been changed in order to be more precise and to conform with
A002335. The offset has been changed to 1. -
Wolfdieter Lang, Feb 12 2015
A254761
One half of the fundamental positive solution y = y1(n) of the first class of the Pell equation x^2 - 2*y^2 = A007519(n), n >= 1 (primes congruent to 1 mod 8).
Original entry on oeis.org
1, 1, 1, 2, 3, 1, 2, 2, 4, 5, 2, 1, 4, 6, 1, 4, 2, 1, 7, 3, 1, 7, 8, 2, 4, 1, 5, 6, 5, 3, 2, 8, 10, 2, 6, 1, 7, 8, 9, 10, 4, 7, 3, 2, 9, 1, 12, 7, 3, 5
Offset: 1
See A254760.
n = 3: 9^2 - 2*(2*1)^2 = 81 - 8 = 73.
A255246
Fundamental positive solution y = y1(n) of the first class of the Pell equation x^2 - 2*y^2 = -A038873(n), n>=1 (primes congruent to {1,2,7} mod 8).
Original entry on oeis.org
3, 2, 3, 4, 4, 5, 6, 6, 7, 8, 7, 7, 8, 9, 8, 9, 10, 12, 10, 11, 10, 14, 11, 12, 11, 13, 12, 14, 15, 14, 13, 13, 17, 18, 14, 14, 15, 17, 16, 19, 20, 15, 17, 16, 18, 16, 16, 21, 17, 17, 21, 18, 19, 22, 23, 20, 19, 18, 19, 20, 26, 22, 20, 21, 23, 25, 26, 28, 21
Offset: 1
See A255235.
n = 1: 4^2 - 2*3^2 = -2 = -A038873(1),
n = 3: 1^2 - 2*3^2 = 1 - 18 = -17 = -A038873(3).
A254765
Fundamental positive solution y = y1(n) of the first class of the Pell equation x^2 - 2*y^2 = A007522(n), n >=1 (primes congruent to 7 mod 8).
Original entry on oeis.org
1, 1, 3, 1, 5, 1, 3, 7, 3, 1, 7, 9, 1, 5, 7, 3, 5, 1, 9, 11, 7, 1, 9, 5, 11, 13, 11, 3, 7, 17, 11, 1, 7, 13, 3, 1, 7, 13, 5, 15, 21, 11, 7, 13, 5, 9, 1, 17, 23, 1
Offset: 1
A254764(4)^2 - 2*a(4)^2 = 7^2 - 2*1^2 = 47 = A007522(4).
A254930
Fundamental positive solution x = x2(n) of the second class of the Pell equation x^2 - 2*y^2 = A001132(n), n >= 1 (primes congruent to 1 or 7 mod 8).
Original entry on oeis.org
5, 7, 11, 9, 13, 17, 13, 19, 23, 17, 15, 21, 25, 17, 23, 27, 35, 23, 29, 21, 41, 25, 31, 23, 35, 29, 39, 43, 37, 31, 27, 49, 53, 33, 31, 37, 47, 41, 55, 59, 31, 45, 39, 49, 37, 35, 61, 37, 35
Offset: 1
n = 3: 11^2 - 2*7^2 = 23 = A001132(3) = A007522(2).
The first pairs of these second class solutions [x2(n), y2(n)] are (a star indicates primes congruent to 1 (mod 8)):
n A001132(n) a(n) A254931(n)
1 7 5 3
2 17 * 7 4
3 23 11 7
4 31 9 5
5 41 * 13 8
6 47 17 11
7 71 13 7
8 73 * 19 12
9 89 * 17 10
10 97 * 15 8
11 103 21 13
12 113 * 25 16
13 127 17 9
14 137 * 23 14
15 151 27 17
16 167 35 23
17 191 23 13
18 193 * 29 18
19 199 21 11
20 223 41 27
...
-
Reap[For[p = 2, p < 1000, p = NextPrime[p], If[MatchQ[Mod[p, 8], 1|7], rp = Reduce[x > 0 && y > 0 && x^2 - 2 y^2 == p, {x, y}, Integers]; If[rp =!= False, xy = {x, y} /. {ToRules[rp /. C[1] -> 1]}; x2 = xy[[-1, 1]] // Simplify; Print[x2]; Sow[x2]]]]][[2, 1]] (* Jean-François Alcover, Oct 28 2019 *)
A254931
Fundamental positive solution y = y2(n) of the second class of the Pell equation x^2 - 2*y^2 = A001132(n), n >= 1, (primes congruent to 1 or 7 mod 8).
Original entry on oeis.org
3, 4, 7, 5, 8, 11, 7, 12, 15, 10, 8, 13, 16, 9, 14, 17, 23, 13, 18, 11, 27, 14, 19, 12, 22, 17, 25, 28, 23, 18, 14, 32, 35, 19, 17, 22, 30, 25, 36, 39, 16, 28, 23, 31, 21, 19, 40, 20, 18, 38
Offset: 1
a(4) = 2*7 - 3*3 = 5.
A254930(4)^2 - 2*a(4)^2 = 9^2 - 2*5^2 = 31 = A001132(4) = A007522(3).
See A254930 for the first pairs (x2(n), y2(n)).
-
Reap[For[p = 2, p < 1000, p = NextPrime[p], If[MatchQ[Mod[p, 8], 1|7], rp = Reduce[x > 0 && y > 0 && x^2 - 2 y^2 == p, {x, y}, Integers]; If[rp =!= False, xy = {x, y} /. {ToRules[rp /. C[1] -> 1]}; y2 = xy[[-1, 2]] // Simplify; Print[y2]; Sow[y2]]]]][[2, 1]] (* Jean-François Alcover, Oct 28 2019 *)
Showing 1-6 of 6 results.
Comments