|
%I #8 Feb 04 2019 07:18:55
%S 1,2,3,3,4,5,3,5,7,5,6,7,3,7,11,3,5,8,11,13,5,7,9,11,13,3,7,10,13,17,
%T 3,5,11,17,19,5,7,11,12,13,17,19,3,7,13,19,23,5,11,14,17,23,7,11,13,
%U 15,17,19,23,3,13,16,19,29,3,5,11,17,23,29
%N Triangle read by rows in which row n lists: n, in the center of the row and the pairs of prime numbers that are equidistant to n, as shown below in the example.
%H Nathaniel Johnston, <a href="/A154726/b154726.txt">Table of n, a(n) for n = 1..10000</a>
%e Triangle begins:
%e 1
%e 2
%e 3
%e 3 4 5
%e 3 . 5 . 7
%e . . 5 6 7 . .
%e 3 . . . 7 . . . 11
%e 3 . 5 . . 8 . . 11 . 13
%e . . 5 . 7 . 9 . 11 . 13 . .
%e 3 . . . 7 . . 10 . . 13 . . . 17
%p for n from 1 to 10 do for k from 1 to 2*n-1 do if(k=n or (isprime(k) and isprime(2*n-k)))then print(k):fi:od:od: # _Nathaniel Johnston_, Apr 18 2011
%Y Cf. A000040, A154720, A154721, A154722, A154723, A154724, A154725, A154727.
%K easy,nonn,tabf
%O 1,2
%A _Omar E. Pol_, Jan 14 2009
%E a(31)-a(70) from _Nathaniel Johnston_, Apr 18 2011
|
