A219244 - OEIS

The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

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 (list; graph; refs; listen; history; text; internal format)

	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	`Sequence in context: A070000 A227736 A228528 * A330231 A323017 A273638` `Adjacent sequences: A219241 A219242 A219243 * A219245 A219246 A219247`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller, Nov 16 2012`
	STATUS	`approved`

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 19 01:11 EST 2021. Contains 340262 sequences. (Running on oeis4.)