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 #13 Sep 02 2024 11:23:56
%S 691,1399,1699,5791,6091,6691,6793,7297,8599,10993,12391,12799,13999,
%T 14197,14293,15091,15391,15991,17599,18493,18691,19699,22699,22993,
%U 23899,24499,24799,25693,26893,27397,28099,28297,28393,29191,33493
%N Prime p1 of consecutive primes p1, p2, where p2-p1=10, and p1, p2 are in different centuries.
%C The sequence is probably infinite.
%C It appears that every integer occurs as the difference round((a(n+1)-a(n))/100); all numbers 1..228 occur as these differences for a(n) < 1000000000. - _Hartmut F. W. Hoft_, May 18 2017
%H Harvey P. Dale, <a href="/A160500/b160500.txt">Table of n, a(n) for n = 1..1000</a>
%e Consecutive primes 10993 and 11003 differ by 10 and are in consecutive centuries, so 10993 is in the sequence.
%t a160500[n_] := Map[Last, Select[Map[{NextPrime[#, 1], NextPrime[#, -1]}&, Range[100, n, 100]], First[#]-Last[#]==10&]]
%t a160500[33500] (* data *) (* _Hartmut F. W. Hoft_, May 18 2017 *)
%t cpdcQ[{a_,b_}]:=b-a==10&&Floor[a/100]!=Floor[b/100]; Select[Partition[Prime[Range[ 4000]],2,1],cpdcQ][[;;,1]] (* _Harvey P. Dale_, Sep 02 2024 *)
%Y Cf. A160440, A160370, A031928.
%K nonn
%O 1,1
%A _Ki Punches_, May 15 2009
%E Edited by _Ray Chandler_, May 22 2009