cp's OEIS Frontend

A146941 Odd prime difference array. Let p(n) be the n-th odd prime; row n consists of all k such that p(k+1)-p(k)=2n.

%I A146941 #8 Jan 22 2014 10:59:48
%S A146941 1,2,3,4,5,8,6,7,10,23,9,11,14,71,33,12,13,15,76,41,45,16,18,17,78,52,
%T A146941 46,29,19,21,20,86,60,90,61,281,25,24,22,91,67,96,65,294,98,27,26,31,
%U A146941 93,79,113,136,318,179,153,32,28,35,123,81,120,145,330,204,258,188,34
%N A146941 Odd prime difference array. Let p(n) be the n-th odd prime; row n consists of all k such that p(k+1)-p(k)=2n.
%C A146941 (Column 1) = A073051.
%H A146941 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>
%e A146941 Northwest corner:
%e A146941 1 2 4 6 9
%e A146941 3 5 7 11 13
%e A146941 8 10 14 15 17
%e A146941 23 71 76 78 86
%e A146941 Row 3: 6=p(9)-p(8)=p(11)-p(9)=p(15)-p(14)
%e A146941 That's 6=29-23=37-31=53-47.
%o A146941 (PARI) lista_by_rows(nn) = {for (n=1, nn, nb = 0; k = 2; ok = 0; until(ok, if (prime(k+1) - prime(k) == 2*n, print1(k-1, ", "); nb++; if (nb == nn, ok = 1);); k++;); print(););} \\ _Michel Marcus_, Apr 21 2013
%Y A146941 Cf. A000040, A073051
%K A146941 nonn,tabl
%O A146941 1,2
%A A146941 _Clark Kimberling_, Nov 02 2008