login
T(n,k) = prime(n+1) - prime(n-k+1), 1<=k<=n, triangular array read by rows.
1

%I #5 Sep 15 2012 14:44:56

%S 1,2,3,2,4,5,4,6,8,9,2,6,8,10,11,4,6,10,12,14,15,2,6,8,12,14,16,17,4,

%T 6,10,12,16,18,20,21,6,10,12,16,18,22,24,26,27,2,8,12,14,18,20,24,26,

%U 28,29,6,8,14,18,20,24,26,30,32,34,35,4,10,12,18,22,24,28,30,34,36,38

%N T(n,k) = prime(n+1) - prime(n-k+1), 1<=k<=n, triangular array read by rows.

%C Row-reversed A086800. - _R. J. Mathar_, Sep 15 2012

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/PrimeDifferenceFunction.html">Prime Difference Function</a>

%F T(n,1) = A001223(n); T(n,n) = A040976(n).

%e 1;

%e 2, 3;

%e 2, 4, 5;

%e 4, 6, 8, 9;

%e 2, 6, 8, 10, 11;

%e 4, 6, 10, 12, 14, 15;

%Y Cf. A000040.

%K nonn,tabl

%O 1,2

%A _Reinhard Zumkeller_, Jan 26 2004