|
%I #41 Aug 28 2022 04:54:20
%S 139,181,241,283,337,409,421,547,577,631,691,709,787,811,829,919,1021,
%T 1039,1051,1153,1171,1249,1399,1471,1627,1699,1723,1801,1879,2017,
%U 2029,2053,2089,2143,2521,2647,2719,2731,2767,2887,2917,3001,3109,3361,3517,3547,3571,3583,3709,3769,3823,3853,4201,4219,4231,4243,4261,4273,4327,4339,4363,4483,4663,4861,4909,4957,5011,5179,5323,5581,5659,5701,5791,5869,6079,6091
%N Lower prime of a difference of 10 between consecutive primes.
%C Conjecture: The sequence is infinite and for every n, a(n+1) < a(n)^(1+1/n). Namely, a(n)^(1/n) is a strictly decreasing function of n (see comments at A248855). - _Jahangeer Kholdi_ and _Farideh Firoozbakht_, Nov 29 2014
%H Charles R Greathouse IV, <a href="/A031928/b031928.txt">Table of n, a(n) for n = 1..10000</a>
%H <a href="/index/Pri#gaps">Index entries for primes, gaps between</a>
%t Transpose[Select[Partition[Prime[Range[800]], 2, 1], #[[2]] - #[[1]] == 10&]] [[1]] (* _Harvey P. Dale_, Oct 02 2014 *)
%t p = Prime@Range@800; p[[Flatten@Position[Differences@p, 10]]] (* _Hans Rudolf Widmer_, Aug 28 2022 *)
%o (Magma) [p: p in PrimesUpTo(7000) | NextPrime(p)-p eq 10]; // _Bruno Berselli_, Apr 09 2013
%o (PARI) forprime(p=o=1,1e4,10+o==(o=p)&&print1(p-10",")) \\ _M. F. Hasler_, Mar 10 2017
%Y Cf. A023203, A053323, A248855, A290450.
%K nonn,easy
%O 1,1
%A _Lekraj Beedassy_, Jul 23 2003
%E Edited by _Labos Elemer_, Jul 25 2003
|
