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

Author

Reinhard Zumkeller, Nov 16 2012

Keywords

• nonn

Comments

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

Links

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

Crossrefs

Cf. A185934, A217659.

Programs

Haskell

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

Mathematica

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