login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A028871 Primes of the form k^2 - 2. 47

%I #62 Dec 12 2023 07:58:09

%S 2,7,23,47,79,167,223,359,439,727,839,1087,1223,1367,1847,2207,2399,

%T 3023,3719,3967,4759,5039,5623,5927,7919,8647,10607,11447,13687,14159,

%U 14639,16127,17159,18223,19319,21023,24023,25919,28559,29927

%N Primes of the form k^2 - 2.

%C Except for the initial term, primes equal to the product of two consecutive even numbers minus 1. - _Giovanni Teofilatto_, Sep 24 2004

%C With exception of the first term 2, primes p such that continued fraction of (1+sqrt(p))/2 have period 4. - _Artur Jasinski_, Feb 03 2010

%C Subsequence of A094786. First primes q that are in A094786 but not here are 241, 3373, 6857, 19681, 29789, 50651, 300761, 371291, ...; q+2 are perfect powers m^k with odd k>1. - _Zak Seidov_, Dec 09 2014

%D D. Shanks, Solved and Unsolved Problems in Number Theory, 2nd. ed., Chelsea, 1978, p. 31.

%H Nathaniel Johnston, <a href="/A028871/b028871.txt">Table of n, a(n) for n = 1..10000</a>

%H P. De Geest, <a href="http://www.worldofnumbers.com/consemor.htm">Palindromic Quasipronics of the form n(n+x)</a>

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/Near-SquarePrime.html">Near-Square Prime</a>

%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Bunyakovsky_conjecture">Bunyakovsky conjecture</a>

%F a(n) = A022870(n)^2 -2. - _R. J. Mathar_, Dec 12 2023

%p select(isprime, [2,seq((2*n+1)^2-2, n=1..1000)]); # _Robert Israel_, Dec 09 2014

%t lst={};Do[s=n^2;If[PrimeQ[p=s-2], AppendTo[lst, p]], {n, 6!}];lst (* _Vladimir Joseph Stephan Orlovsky_, Sep 26 2008 *)

%t aa = {}; Do[If[4 == Length[ContinuedFraction[(1 + Sqrt[Prime[m]])/2][[2]]], AppendTo[aa, Prime[m]]], {m, 1, 1000}]; aa (* _Artur Jasinski_, Feb 03 2010 *)

%t Select[Table[n^2 - 2, {n, 400}], PrimeQ] (* _Vincenzo Librandi_, Jun 19 2014 *)

%o (PARI) list(lim)=select(n->isprime(n),vector(sqrtint(floor(lim)+2),k,k^2-2)) \\ _Charles R Greathouse IV_, Jul 25 2011

%o (Haskell)

%o a028871 n = a028871_list !! (n-1)

%o a028871_list = filter ((== 1) . a010051') a008865_list

%o -- _Reinhard Zumkeller_, May 06 2013

%o (Magma) [p: p in PrimesUpTo(100000)| IsSquare(p+2)]; // _Vincenzo Librandi_, Jun 19 2014

%Y Cf. A028870, A089623, A010051, A094786; subsequence of A008865.

%K nonn,easy

%O 1,1

%A _Patrick De Geest_

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 05:18 EDT 2024. Contains 371964 sequences. (Running on oeis4.)