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.

A002496 Primes of the form k^2 + 1.

Original entry on oeis.org

2, 5, 17, 37, 101, 197, 257, 401, 577, 677, 1297, 1601, 2917, 3137, 4357, 5477, 7057, 8101, 8837, 12101, 13457, 14401, 15377, 15877, 16901, 17957, 21317, 22501, 24337, 25601, 28901, 30977, 32401, 33857, 41617, 42437, 44101, 50177
Offset: 1

Views

Author

N. J. A. Sloane

Keywords

Comments

It is conjectured that this sequence is infinite, but this has never been proved.
An equivalent description: primes of form P = (p1*p2*...*pm)^k + 1 where p1..pm are primes and k > 1, since then k must be even for P to be prime.
Also prime = p(n) if A054269(n) = 1, i.e., quotient-cycle-length = 1 in continued fraction expansion of sqrt(p). - Labos Elemer, Feb 21 2001
Also primes p such that phi(p) is a square.
Also primes of form x*y + z, where x, y and z are three successive numbers. - Giovanni Teofilatto, Jun 05 2004
It is a result that goes back to Mirsky that the set of primes p for which p-1 is squarefree has density A, where A = A005596 denotes the Artin constant. More precisely, Sum_{p <= x} mu(p-1)^2 = A*x/log x + o(x/log x) as x tends to infinity. Conjecture: Sum_{p <= x, mu(p-1)=1} 1 = (A/2)*x/log x + o(x/log x) and Sum_{p <= x, mu(p-1)=-1} 1 = (A/2)*x/log x + o(x/log x). - Pieter Moree (moree(AT)mpim-bonn.mpg.de), Nov 03 2003
Also primes of the form x^y + 1, where x > 0, y > 1. Primes of the form x^y - 1 (x > 0, y > 1) are the Mersenne primes listed in A000668(n) = {3, 7, 31, 127, 8191, 131071, 524287, 2147483647, ...}. - Alexander Adamchuk, Mar 04 2007
With the exception of the first two terms {2,5}, the continued fraction (1 + sqrt(p))/2 has period 3. - Artur Jasinski, Feb 03 2010
With the exception of the first term {2}, congruent to 1 (mod 4). - Artur Jasinski, Mar 22 2011
With the exception of the first two terms, congruent to 1 or 17 (mod 20). - Robert Israel, Oct 14 2014
From Bernard Schott, Mar 22 2019: (Start)
These primes are the primitive terms which generate the sequence of integers with only one prime factor and whose Euler's totient is a square: A054755. So this sequence is a subsequence of A054755 and of A039770. Additionally, the terms of this sequence also have a square cototient, so this sequence is a subsequence of A063752 and A054754.
If p prime = n^2 + 1, phi(p) = n^2 and cototient(p) = 1^2.
Except for 3, the four Fermat primes in A019434 {5, 17, 257, 65537}, belong to this sequence; with F_k = 2^(2^k) + 1, phi(F_k) = (2^(2^(k-1)))^2.
See the file "Subfamilies and subsequences" (& I) in A039770 for more details, proofs with data, comments, formulas and examples. (End)
In this sequence, primes ending with 7 seem to appear twice as often as primes ending with 1. This is because those with 7 come from integers ending with 4 or 6, while those with 1 come only from integers ending with 0 (see De Koninck & Mercier reference). - Bernard Schott, Nov 29 2020
The set of odd primes p for which every elliptic curve of the form y^2 = x^3 + d*x has order p-1 over GF(p) for those d with (d,p)=1 and d a fourth power modulo p. - Gary Walsh, Sep 01 2021 [edited, Gary Walsh, Apr 26 2025]

References

  • Jean-Marie De Koninck & Armel Mercier, 1001 Problèmes en Théorie Classique des Nombres, Problème 211 pp. 34 and 169, Ellipses, Paris, 2004.
  • Leonhard Euler, De numeris primis valde magnis (E283), reprinted in: Opera Omnia. Teubner, Leipzig, 1911, Series (1), Vol. 3, p. 22.
  • G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, 5th ed., Oxford Univ. Press, 1979, th. 17.
  • Hugh L. Montgomery, Ten Lectures on the Interface Between Analytic Number Theory and Harmonic Analysis, Amer. Math. Soc., 1996, p. 208.
  • C. Stanley Ogilvy, Tomorrow's Math. 2nd ed., Oxford Univ. Press, 1972, p. 116.
  • 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).
  • James J. Tattersall, Elementary Number Theory in Nine Chapters, Cambridge University Press, 1999, page 118.
  • David Wells, The Penguin Dictionary of Curious and Interesting Numbers (Rev. ed. 1997), p. 134.

Links

Crossrefs

Cf. A083844 (number of these primes < 10^n), A199401 (growth constant).
Cf. A001912, A005574, A054964, A062325, A088179, A090693, A141293, A172168.
Cf. A000668 (Mersenne primes), A019434 (Fermat primes).
Subsequence of A039770.
Cf. A010051, subsequence of A002522.
Cf. A237040 (an analog for n^3 + 1).
Cf. A010051, A000290; subsequence of A028916.
Subsequence of A039770, A054754, A054755, A063752.
Primes of form n^2+b^4, b fixed: A243451 (b=2), A256775 (b=3), A256776 (b=4), A256777 (b=5), A256834 (b=6), A256835 (b=7), A256836 (b=8), A256837 (b=9), A256838 (b=10), A256839 (b=11), A256840 (b=12), A256841 (b=13).
Cf. A030430 (primes ending with 1), A030432 (primes ending with 7).

Programs

  • Haskell
    a002496 n = a002496_list !! (n-1)
a002496_list = filter ((== 1) . a010051') a002522_list
-- Reinhard Zumkeller, May 06 2013
  • Magma
    [p: p in PrimesUpTo(100000)| IsSquare(p-1)]; // Vincenzo Librandi, Apr 09 2011
  • Maple
    select(isprime, [2, seq(4*i^2+1, i= 1..1000)]); # Robert Israel, Oct 14 2014
  • Mathematica
    Select[Range[100]^2+1, PrimeQ]
Join[{2},Select[Range[2,300,2]^2+1,PrimeQ]] (* Harvey P. Dale, Dec 18 2018 *)
  • PARI
    isA002496(n) = isprime(n) && issquare(n-1) \\ Michael B. Porter, Mar 21 2010
  • PARI
    is_A002496(n)=issquare(n-1)&&isprime(n) \\ For "random" numbers in the range 10^10 and beyond, at least 5 times faster than the above. - M. F. Hasler, Oct 14 2014
  • Python
    # Python 3.2 or higher required
from itertools import accumulate
from sympy import isprime
A002496_list = [n+1 for n in accumulate(range(10**5),lambda x,y:x+2*y-1) if isprime(n+1)] # Chai Wah Wu, Sep 23 2014
  • Python
    # Python 2.4 or higher required
from sympy import isprime
A002496_list = list(filter(isprime, (n*n+1 for n in range(10**5)))) # David Radcliffe, Jun 26 2016

Formula

There are O(sqrt(n)/log(n)) terms of this sequence up to n. But this is just an upper bound. See the Bateman-Horn or Wolf papers, for example, for the conjectured for what is believed to be the correct density.
a(n) = 1 + A005574(n)^2. - R. J. Mathar, Jul 31 2015
Sum_{n>=1} 1/a(n) = A172168. - Amiram Eldar, Nov 14 2020
a(n+1) = 4*A001912(n)^2 + 1. - Hal M. Switkay, Apr 03 2022

Extensions

Formula, reference, and comment from Charles R Greathouse IV, Aug 24 2009
Edited by M. F. Hasler, Oct 14 2014

A054755 Odd powers of primes of the form q = x^2 + 1 (A002496).

Original entry on oeis.org

2, 5, 8, 17, 32, 37, 101, 125, 128, 197, 257, 401, 512, 577, 677, 1297, 1601, 2048, 2917, 3125, 3137, 4357, 4913, 5477, 7057, 8101, 8192, 8837, 12101, 13457, 14401, 15377, 15877, 16901, 17957, 21317, 22501, 24337, 25601, 28901, 30977, 32401
Offset: 1

Views

Author

Labos Elemer, Apr 25 2000

Keywords

Comments

A002496 is a subset; the odd power exponent is 1.
From Bernard Schott, Mar 16 2019: (Start)
The terms of this sequence are exactly the integers with only one prime factor and whose Euler's totient is square, so this sequence is a subsequence of A039770. The primitive terms of this sequence are the primes of the form q = x^2 + 1, which are exactly in A002496.
Additionally, the terms of this sequence also have a square cototient, so this sequence is a subsequence of A063752 and A054754.
If q prime = x^2 + 1, phi(q) = x^2, phi(q^(2k+1)) = (x*q^k)^2, and cototient(q) = 1^2, cototient(q^(2k+1)) = (q^k)^2. (End)

Examples

			a(20) = 3125 = 5^5, q = 5 = 4^2+1 and Phi(3125) = 2500 = 50^2, cototient(3125) = 3125 - Phi(3125) = 625 = 25^2.

Links

Crossrefs

Cf. A000010, A051953, A039770, A063752, A054754, A334745 (with 2 distinct prime factors), A306908 (with 3 distinct prime factors).
Subsequences: A002496 (primitive primes: m^2+1), A004171 (2^(2k+1)), A013710 (5^(2k+1)), A013722 (17^(2k+1)), A262786 (37^(2k+1)).

Programs

  • Mathematica
    Select[Range[10^5], And[PrimeNu@ # == 1, IntegerQ@ Sqrt@ EulerPhi@ #] &] (* Michael De Vlieger, Mar 31 2019 *)
  • PARI
    isok(m) = (omega(m)==1) && issquare(eulerphi(m)); \\ Michel Marcus, Mar 16 2019
  • PARI
    upto(n) = {my(res = List([2]), q); forstep(i = 2, sqrtint(n), 2, if(isprime(i^2 + 1), listput(res, i^2 + 1) ) ); q = #res; forstep(i = 3, logint(n, 2), 2, for(j = 1, q, c = res[j]^i; if(c <= n, listput(res, c) , next(2) ) ) ); listsort(res); res } \\ David A. Corneth, Mar 17 2019

Formula

A000010(a(n)) = (q^(2k))*(q-1) and A051953(a(n)) = q^(2k), where q = 1 + x^2 and is prime.

A281016 Numbers k such that k, phi(k) and cototient(k) are all perfect powers.

Original entry on oeis.org

8, 16, 32, 64, 125, 128, 256, 512, 1024, 2048, 3125, 4096, 4913, 8192, 16384, 32768, 50653, 65536, 78125, 131072, 262144, 524288, 1030301, 1048576, 1419857, 1953125, 2097152, 4194304, 7645373, 8388608, 16777216, 16974593, 33554432, 35831808, 48828125, 64481201, 67108864, 69343957
Offset: 1

Views

Author

Altug Alkan, Jan 13 2017

Keywords

Comments

This sequence does not contain only prime powers. Least term that has a prime factor which is not of the form m^2 + 1 is 35831808 = 2^14 * 3^7. The next one is 102503232 = 2^6 * 3^6 * 13^3. There are infinitely many such numbers.
Contains 2^a * 3^b whenever min(GCD(a,b), GCD(a,b-1), GCD(a+1,b-1)) > 1, e.g. if a == 14 (mod 42) and b == 7 (mod 42). - Robert Israel, Jul 08 2025

Examples

			125 = 5^3 is a term because phi(5^3) = 10^2 and cototient(5^3) = 5^2.

Links

Crossrefs

Cf. A000010, A001597, A051953, A054754, A166955.

Programs

  • Maple
    ispow:= proc(n) local F;
  F:= ifactors(n)[2];
  igcd(F[..,2]) > 1
end proc:
N:= 10^8: # for terms <= N
P:= select(isprime, [2,seq(i,i=3..isqrt(N),2)]):
Cands:= {seq(seq(i^p, i = 2 .. floor(N^(1/p))),p = P)}:
filter:= proc(n) local t; t:= numtheory:-phi(n); ispow(t) and ispow(n-t) end proc:
sort(convert(select(filter, Cands),list)); # Robert Israel, Jul 08 2025
  • Mathematica
    Select[Range[10^6], Times @@ Boole@ Map[Or[# == 1, GCD @@ FactorInteger[#][[All, 2]] > 1] &, {#, EulerPhi@ #, # - EulerPhi@ #}] > 0 &] (* Michael De Vlieger, Jan 14 2017 *)
  • PARI
    is(n) = ispower(eulerphi(n)) && ispower(n-eulerphi(n)) && ispower(n);

A054756 Numbers k such that phi(k) and cototient(k) are squares but k is not in A054755.

Original entry on oeis.org

1, 468, 1417, 1872, 2340, 3145, 4100, 4212, 7488, 9360, 14841, 15588, 16400, 16848, 20329, 21060, 29952, 31417, 37440, 37908, 45097, 49833, 58500, 62352, 63529, 63945, 65600, 67392, 69700, 78625, 79092, 83569, 84169, 84240, 88929, 102500
Offset: 1

Views

Author

Labos Elemer, Apr 25 2000

Keywords

Examples

			An even term is 2340 = 4*9*5*13 (phi = 576 = 24^2 and cototient = 1764 =  42^2).
An odd term is 14841 = 9*17*97 (phi = 9216 = 96^2, cototient = 5625 = 75^2).

Links

Crossrefs

Cf. A000010, A002496, A005574, A039770, A051953.
Equals A054754 \setminus A054755. See also A063752.

Programs

  • Mathematica
    Select[ Range[ 1, 200000 ], IntegerQ[ Sqrt[ eu[ # ] ] ]&& IntegerQ[ Sqrt[ co[ # ] ] ]&&!Equal[ lfi[ # ], 1 ]& ], where eu[ x_ ] =EulerPhi[ x ], co[ x_ ]=x-EulerPhi[ x ] and lfi[ x_ ]=Length[ FactorInteger[ x ] ]

Formula

phi(a(n)) = x^2, a(n) - phi(a(n)) = y^2, a(n) is not an odd power of prime from A002496.
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.