Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A002496
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A002496 Primes of form n^2 + 1.
(Formerly M1506 N0592)
+0
58
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 (list; graph; listen)
OFFSET

1,1

COMMENT

It is conjectured that this sequence is infinite, but this has never been proved.

An equivalent description: primes of form m= (p1*p2*...*pm)^k + 1 where p1 ... pm are primes and k>1, since then k must be even for m 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 E. (labos(AT)ana.sote.hu), Feb 21 2001

Also primes of form x*y + z, where x, y and z are three successive numbers. - Giovanni Teofilatto (g.teofilatto(AT)tiscalinet.it), Jun 05 2004

From Pieter Moree (moree(AT)science.uva.nl), Nov 03 2003: 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 denotes the Artin constant (A = prod_q (1-1/(q(q-1))), q running over all primes). Numerically A = 0.3739558136.... More precisely, Sum_{p <= x} mu(p-1)^2 = Ax/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).

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 (alex(AT)kolmogorov.com), Mar 04 2007

REFERENCES

J.-M. De Koninck & A. Mercier, 1001 Problemes en Theorie Classique Des Nombres, Problem 211 pp. 34; 169, Ellipses Paris 2004.

L. 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.

Leon Mirsky, Amer. Math. Monthly 56 (1949), 17-19.

H. L. Montgomery, Ten Lectures on the Interface Between Analytic Number Theory and Harmonic Analysis, Amer. Math. Soc., 1996, p. 208.

C. S. Ogilvy, Tomorrow's Math. 2nd ed., Oxford Univ. Press, 1972, p. 116.

David Wells, The Penguin Dictionary of Curious and Interesting Numbers (Rev. ed. 1997), p. 134

LINKS

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

F. Ellermann, Primes of the form (m^2)+1 up to 10^6

Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.

Eric Weisstein's World of Mathematics, Near-Square Prime

Marek Wolf, Search for primes of the form m^2+1

MATHEMATICA

Intersection[Table[n^2 + 1, {n, 225}], Prime[Range[5153]]]

CROSSREFS

Cf. A083844 (number of these primes < 10^n).

Cf. A001912, A005574, A054964, A062325, A088179, A090693.

Cf. A000668 = Mersenne primes.

Adjacent sequences: A002493 A002494 A002495 this_sequence A002497 A002498 A002499

Sequence in context: A107630 A078523 A078324 this_sequence A127436 A064168 A118727

KEYWORD

nonn,easy,nice

AUTHOR

njas

page 1

Search completed in 0.003 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified May 15 13:16 EDT 2008. Contains 139641 sequences.


AT&T Labs Research