A185154 Smallest prime p such that a nonconsecutive prime q exists with A157996(n) = p + q + 1.

3, 3, 5, 3, 5, 7, 5, 3, 5, 3, 5, 5, 7, 5, 3, 5, 5, 3, 5, 7, 3, 5, 3, 5, 3, 13, 3, 5, 7, 11, 11, 5, 5, 3, 5, 5, 7, 11, 11, 3, 5, 11, 11, 3, 5, 3, 5, 7, 11, 5, 5, 5, 7, 5, 3, 5, 11, 13, 3, 5, 3, 13, 5, 29, 11, 3, 5, 7, 5, 5, 3, 5, 7, 3, 7, 17, 11, 11, 11, 5, 3

Offset: 1

Author

Reinhard Zumkeller, Mar 12 2012

Keywords

• nonn

Comments

A010051(A157996(n) - a(n) - 1) = 1.

Links

• Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

Crossrefs

Cf. A065091, A006093.

Programs

Haskell

import Data.Maybe (catMaybes)
a185154 n = a185154_list !! (n-1)
a185154_list = catMaybes $ map f a006093_list where
   f x = g $ takeWhile (< x) a065091_list where
     g []  = Nothing
     g [_] = Nothing
     g (p:ps@(_:qs)) | (x - p) `elem` qs = Just p
                     | otherwise         = g ps