login
Triangle read by rows: T(n,k) = (n + k) if (n + k) is a prime number, otherwise T(n,k) = 0; n >= 1, k >= 1.
1

%I #39 Jul 21 2022 10:46:49

%S 2,3,0,0,5,0,5,0,7,0,0,7,0,0,0,7,0,0,0,11,0,0,0,0,11,0,13,0,0,0,11,0,

%T 13,0,0,0,0,11,0,13,0,0,0,17,0,11,0,13,0,0,0,17,0,19,0,0,13,0,0,0,17,

%U 0,19,0,0,0,13,0,0,0,17,0,19,0,0,0,23,0

%N Triangle read by rows: T(n,k) = (n + k) if (n + k) is a prime number, otherwise T(n,k) = 0; n >= 1, k >= 1.

%C Row sums see A341700.

%e The triangle begins:

%e k=1 2 3 4 5 6

%e n=1: 2;

%e n=2: 3, 0;

%e n=3: 0, 5, 0;

%e n=4: 5, 0, 7, 0;

%e n=5: 0, 7, 0, 0, 0;

%e n=6: 7, 0, 0, 0, 11, 0;

%e and so on.

%t T[n_, k_] := If[PrimeQ[n + k], n + k, 0]; Table[T[n, k], {n, 1, 12}, {k, 1, n}] // Flatten (* _Amiram Eldar_, Jul 21 2022 *)

%Y Cf. A000040, A341700.

%K nonn,tabl

%O 1,1

%A _Ctibor O. Zizka_, Jul 21 2022