OFFSET
1,1
COMMENTS
The only possible pairs for 2a(n)+-1 are prime/prime (this sequence), not prime/not prime (A104278), prime/notprime (A104279) and not prime/prime (A104280), ... this sequence + A104280 + A104279 + A104278 = the odd numbers.
These numbers are never k mod (2k+1) or (k+1) mod (2k+1) with 2k+1 < a(n). - Jon Perry, Sep 04 2012
Excluding the first term, all remaining terms have digital root 3, 6 or 9. - J. W. Helkenberg, Jul 24 2013
Positive numbers x such that the difference between x^2 and adjacent squares are prime (both x^2-(x-1)^2 and (x+1)^2-x^2 are prime). - Doug Bell, Aug 21 2015
LINKS
T. D. Noe, Table of n, a(n) for n = 1..10001
FORMULA
For n > 1, a(n) = 3*A002822(n-1). - Jason Kimberley, Nov 06 2015
From Michael G. Kaarhus, Aug 19 2022: (Start)
a(n) = (A001359(n) + 1)/2.
a(n) = (A006512(n) - 1)/2.
For n > 1, a(n) = A167379(n-1) * 3/2. (End)
MAPLE
P := select(isprime, [$1..1789]): map(p->(p+1)/2, select(p->member(p+2, P), P)); # Peter Luschny, Mar 03 2011
MATHEMATICA
Select[Range[900], And @@ PrimeQ[{-1, 1} + 2# ] &] (* Ray Chandler, Oct 12 2005 *)
PROG
(PARI) p=2; forprime(b=3, 1e4, if(b-p==2, print1((p+1)/2", ")); p=b) \\ Altug Alkan, Nov 10 2015
(Haskell)
a040040 = flip div 2 . a014574 -- Reinhard Zumkeller, Nov 17 2015
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
EXTENSIONS
More terms from Cino Hilliard, Oct 21 2002
Title corrected by Daniel Forgues, Jun 01 2009
Edited by Daniel Forgues, Jun 21 2009
Comment corrected by Daniel Forgues, Jul 12 2009
STATUS
approved