A219244 Differences of two consecutive primes which both equal 1 modulo 3, divided by 6.

1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 2, 1, 1, 3, 1, 1, 2, 1, 2, 1, 1, 3, 1, 2, 2, 1, 1, 1, 4, 1, 1, 1, 3, 1, 2, 1, 1, 1, 1, 3, 4, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 2, 1, 2, 2, 1, 2, 1, 1, 1, 2, 2, 1, 1, 2, 1, 1, 1, 1, 1

Offset

1,6

Comments

a(n) = (A217659(n) - A185934(n)) / 6.

Links

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

Mathematica

(Last[#]-First[#])/6&/@Select[Partition[Prime[Range[800]], 2, 1], Mod[First[#], 3] == Mod[Last[#], 3]==1&] (* Harvey P. Dale, Feb 26 2013 *)

Prog

(Haskell)
a219244 n = a219244_list !! (n-1)
a219244_list = map (`div`  6) $ zipWith (-) a217659_list a185934_list

Crossrefs

Cf. A185934, A217659.

Sequence in context: A227736 A228528 A366040 * A330231 A323017 A273638

Adjacent sequences: A219241 A219242 A219243 * A219245 A219246 A219247

Keyword

nonn

Author

Reinhard Zumkeller, Nov 16 2012

Status

approved