Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #12 Feb 11 2021 23:01:00
%S 6,14,14,8,8,14,18,14,18,8,24,8,8,8,18,44,24,38,18,30,14,14,8,14,18,8,
%T 8,8,30,8,38,18,14,14,66,36,26,30,30,8,18,14,8,50,18,18,14,8,66,26,14,
%U 44,38,54,18,18,38,30,8,30,14,24,26,8,26,14,8,8,60,26
%N a(n) = nextprime(16 + A022008(n)) - (16 + A022008(n)).
%C a(n) is the prime difference d >= 6, following [42424] difference pattern defining A022008.
%e n=2: A022008(2)=97, corresponding sextuplet is {97, 101, 103, 107, 109, 113=97+16}, nextprime(113) - 113 = 127 - 113 = 14, so a(2)=14. Constraints for present terms: (a) are incongruent to 4 modulo 6; (b) Mod(a(n), 30) = {0, 6, 8, 14, 18, 20, 24, 26}; 6 occurs only once; (c) further prohibited values like e.g. 20 etc.
%t d[x_] := Prime[x+1]-Prime[x]; Do[If[Equal[d[n], 4]&&Equal[d[n+1], 2]&& Equal[d[n+2], 4]&&Equal[d[n+3], 2]&& Equal[d[n+4], 4], Print[d[n+5]]], {n, 1, 100000}]
%Y Cf. A022008.
%K nonn
%O 1,1
%A _Labos Elemer_, Jan 21 2003