cp's OEIS Frontend

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

%I A090321 #6 Feb 16 2025 08:32:51
%S A090321 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 A090321 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 A090321 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 A090321 T(n,k) = prime(n+1) - prime(n-k+1), 1<=k<=n, triangular array read by rows.
%C A090321 Row-reversed A086800. - _R. J. Mathar_, Sep 15 2012
%H A090321 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/PrimeDifferenceFunction.html">Prime Difference Function</a>
%F A090321 T(n,1) = A001223(n); T(n,n) = A040976(n).
%e A090321 1;
%e A090321 2, 3;
%e A090321 2, 4, 5;
%e A090321 4, 6, 8, 9;
%e A090321 2, 6, 8, 10, 11;
%e A090321 4, 6, 10, 12, 14, 15;
%Y A090321 Cf. A000040.
%K A090321 nonn,tabl
%O A090321 1,2
%A A090321 _Reinhard Zumkeller_, Jan 26 2004