cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-4 of 4 results.

A002313 Primes congruent to 1 or 2 modulo 4; or, primes of form x^2 + y^2; or, -1 is a square mod p.

Original entry on oeis.org

2, 5, 13, 17, 29, 37, 41, 53, 61, 73, 89, 97, 101, 109, 113, 137, 149, 157, 173, 181, 193, 197, 229, 233, 241, 257, 269, 277, 281, 293, 313, 317, 337, 349, 353, 373, 389, 397, 401, 409, 421, 433, 449, 457, 461, 509, 521, 541, 557, 569, 577, 593, 601, 613, 617
Offset: 1

Views

Author

N. J. A. Sloane

Keywords

Comments

Or, primes p such that x^2 - p*y^2 represents -1.
Primes which are not Gaussian primes (meaning not congruent to 3 mod 4).
Every Fibonacci prime (with the exception of F(4) = 3) is in the sequence. If p = 2n+1 is the prime index of the Fibonacci prime, then F(2n+1) = F(n)^2 + F(n+1)^2 is the unique representation of the prime as sum of two squares. - Sven Simon, Nov 30 2003
Except for 2, primes of the form x^2 + 4y^2. See A140633. - T. D. Noe, May 19 2008
Primes p such that for all p > 2, p XOR 2 = p + 2. - Brad Clardy, Oct 25 2011
Greatest prime divisor of r^2 + 1 for some r. - Michel Lagneau, Sep 30 2012
Empirical result: a(n), as a set, compose the prime factors of the family of sequences produced by A005408(j)^2 + A005408(j+k)^2 = (2j+1)^2 + (2j+2k+1)^2, for j >= 0, and a given k >= 1 for each sequence, with the addition of the prime factors of k if not already in a(n). - Richard R. Forberg, Feb 09 2015
Primes such that when r is a primitive root then p-r is also a primitive root. - Emmanuel Vantieghem, Aug 13 2015
Primes of the form (x^2 + y^2)/2. Note that (x^2 + y^2)/2 = ((x+y)/2)^2 + ((x-y)/2)^2 = a^2 + b^2 with x = a + b and y = a - b. More generally, primes of the form (x^2 + y^2) / A001481(n) for every fixed n > 1. - Thomas Ordowski, Jul 03 2016
Numbers n such that ((n-2)!!)^2 == -1 (mod n). - Thomas Ordowski, Jul 25 2016
Primes p such that (p-1)!! == (p-2)!! (mod p). - Thomas Ordowski, Jul 28 2016
The product of 2 different terms (x^2 + y^2)(z^2 + v^2) = (xz + yv)^2 + (xv - yz)^2 is sum of 2 squares (A000404) because (xv - yz)^2 > 0. If x were equal to yz/v then (x^2 + y^2)/(z^2 + v^2) would be equal to ((yz/v)^2 + y^2)/(z^2 + v^2) = y^2/v^2 which is not possible because (x^2 + y^2) and (z^2 + v^2) are prime numbers. For example, (2^2 + 5^2)(4^2 + 9^2) = (2*4 + 5*9)^2 + (2*9 - 5*4)^2. - Jerzy R Borysowicz, Mar 21 2017

Examples

			13 is in the sequence since it is prime and 13 = 4*3 + 1.  Also 13 = 2^2 + 3^2.  And -1 is a square (mod 13): -1 + 2*13 = 25 = 5^2.  Of course, only the first term is congruent to 2 (mod 4). - _Michael B. Porter_, Jul 04 2016

References

  • M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 872.
  • David A. Cox, "Primes of the Form x^2 + n y^2", Wiley, 1989.
  • G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, 5th ed., Oxford Univ. Press, 1979, p. 219, th. 251, 252.
  • 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).

Links

Crossrefs

Apart from initial term, same as A002144. For values of x and y see A002330 and A002331.
Cf. A033203, A038873, A038874, A045331, A008784, A057129, A084163, A084165, A137351.

Programs

  • Haskell
    a002313 n = a002313_list !! (n-1)
a002313_list = filter ((`elem` [1,2]) . (`mod` 4)) a000040_list
-- Reinhard Zumkeller, Feb 04 2014
  • Magma
    [p: p in PrimesUpTo(700) | p mod 4 in {1,2}]; // Vincenzo Librandi, Feb 18 2015
  • Maple
    with(numtheory): for n from 1 to 300 do if ithprime(n) mod 4 = 1 or ithprime(n) mod 4 = 2 then printf(`%d,`,ithprime(n)) fi; od:
# alternative
A002313 := proc(n)
    option remember ;
    local a;
    if n = 1 then
        2;
    elif n = 2 then
        5;
    else
        for a from procname(n-1)+4 by 4 do
            if isprime(a) then
                return a ;
            end if;
        end do:
    end if;
end proc:
seq(A002313(n),n=1..100) ; # R. J. Mathar, Feb 01 2024
  • Mathematica
    Select[ Prime@ Range@ 115, Mod[#, 4] != 3 &] (* Robert G. Wilson v *)
fQ[n_] := Solve[x^2 + 1 == n*y^2, {x, y}, Integers] == {}; Select[ Prime@ Range@ 115, fQ] (* Robert G. Wilson v, Dec 19 2013 *)
  • PARI
    select(p->p%4!=3, primes(1000)) \\ Charles R Greathouse IV, Feb 11 2011

Formula

a(n) ~ 2n log n. - Charles R Greathouse IV, Jul 04 2016
a(n) = A002331(n)^2 + A002330(n)^2. See crossrefs. - Wolfdieter Lang, Dec 11 2016

Extensions

More terms from Henry Bottomley, Aug 10 2000
More terms from James Sellers, Aug 22 2000

A094048 Let p(n) be the n-th prime congruent to 1 mod 4. Then a(n) = the least m for which m^2+1=p(n)*k^2 has a solution.

Original entry on oeis.org

2, 18, 4, 70, 6, 32, 182, 29718, 1068, 500, 5604, 10, 8890182, 776, 1744, 113582, 4832118, 1118, 1111225770, 1764132, 14, 1710, 23156, 71011068, 16, 82, 8920484118, 1063532, 2482, 126862368, 352618
Offset: 1

Views

Author

Matthijs Coster, Apr 29 2004

Keywords

Comments

Subsequence of A191860. [Reinhard Zumkeller, Jun 18 2011]

Crossrefs

Cf. A002144, A094049 (associated k), A130226, A137351, A179073.
Cf. A000196, A037213, A000290.

Programs

  • Haskell
    a094048 n = head [m | m <- map (a037213 . subtract 1 . (* a002144 n))
                               (tail a000290_list), m > 0]
-- Reinhard Zumkeller, Jun 13 2015
  • Mathematica
    f[n_] := Block[{y = 1}, While[ !IntegerQ[ Sqrt[n*y^2 - 1]], y++ ]; Sqrt[n*y^2 - 1]]; lst = {}; Do[p = Prime@ n; If[ Mod[p, 4] == 1, AppendTo[lst, f@p]; Print[{n, Prime@n, f@p}]], {n, 66}]; lst

Extensions

Edited by Don Reble, Apr 30 2004

A172001 Nonsquare positive integers n such that Pell equation y^2 - n*x^2 = -1 has rational solutions but the norm of fundamental unit of quadratic field Q(sqrt(n)) is 1.

Original entry on oeis.org

34, 136, 146, 178, 194, 205, 221, 305, 306, 377, 386, 410, 466, 482, 505, 514, 544, 545, 562, 584, 674, 689, 706, 712, 745, 776, 793, 802, 820, 850, 866, 884, 890, 898, 905, 1154, 1186, 1202, 1205, 1220, 1224, 1234, 1282, 1314, 1345, 1346, 1394, 1405, 1469
Offset: 1

Views

Author

Max Alekseyev, Jan 21 2010

Keywords

Comments

If the fundamental unit y0 + x0*sqrt(n) of Q(sqrt(n)) has norm -1, then (x0,y0) represents a rational solution to Pell equation y^2 - n*x^2 = -1. For n in this sequence, rational solutions exist but not delivered by the fundamental unit.

Crossrefs

Set difference of A000415 and its subsequence A172000.
Set difference of A087643 and its subsequence A022544.
Squarefree terms form A031398.
Odd terms form A249052.
Cf. A031399, A137351.

Formula

A positive integer n is in this sequence iff its squarefree core A007913(n) belongs to A031398.

Extensions

Edited by Max Alekseyev, Mar 09 2010

A249052 Odd numbers n without prime factors of the form 4k+3 such that x^2-n*y^2=-1 has no solutions.

Original entry on oeis.org

205, 221, 305, 377, 505, 545, 689, 725, 745, 793, 905, 1205, 1345, 1405, 1469, 1513, 1517, 1537, 1717, 1885, 1945, 1961, 2005, 2041, 2045, 2105, 2225, 2245, 2329, 2353, 2525, 2533, 2669, 2701, 2845, 2993, 3005, 3205, 3305, 3497, 3505, 3737, 3757, 3805, 3893, 3965, 4069, 4105, 4145, 4205, 4321, 4369
Offset: 1

Views

Author

Joerg Arndt, Apr 09 2008

Keywords

Comments

A positive odd integer n is in this sequence iff its squarefree core A007913(n) belongs to A031398. - Max Alekseyev, Jun 26 2022

Crossrefs

Odd terms of A172001.
Cf. A031398, A031399, A137351.
Showing 1-4 of 4 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.