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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A075889 Primes in A075888, as they appear. 1

%I

%S 3,2,5,3,7,13,5,17,13,7,23,43,17,37,43,67,23,127,137,47,103,167,127,

%T 193,223,163,167,283,103,107,257,137,293,313,487,337,563,613,617,643,

%U 647,433,773,523,283,313,1033,347,373,757,1187,397,1193,797,1277,443

%N Primes in A075888, as they appear.

%C Previous name was: Prime differences of successive primes squared divided by 24, (prime(n+1)^2-prime(n)^2)/24.

%C For n>=3, prime(n+1)^2-prime(n)^2 is always divisible by 24 and for many n's (prime(n+1)^2-prime(n)^2)/24 is prime.

%C Subsequence of primes of A075888. - _Michel Marcus_, Oct 03 2013

%e a(1)=3 because 3 is the first prime value obtained for (prime(n+1)^2-prime(n)^2)/24 and n=5; next prime value is a(2)=2 and corresponds to n=6.

%o (PARI) lista(nn) = {pr = primes(nn); for (n = 4, #pr, if (isprime(q = (pr[n]^2 - pr[n-1]^2)/24), print1(q, ", ")););} \\ _Michel Marcus_, Oct 03 2013

%K easy,nonn

%O 1,1

%A _Zak Seidov_, Oct 17 2002

%E New name from _Michel Marcus_, Oct 05 2013

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.

Last modified December 9 13:46 EST 2022. Contains 358700 sequences. (Running on oeis4.)