|
%I #7 Apr 11 2013 08:36:23
%S 1,2,3,3,5,7,3,7,11,13,5,7,13,19,23,5,11,17,23,29,31,7,13,19,23,31,41,
%T 47,7,13,23,31,37,47,53,61,7,17,23,31,43,53,61,71,79,7,19,29,37,47,59,
%U 67,79,89,97,11,19,31,43,53,61,73,83,97,109,113,11,23,31,47,59,71,83,89
%N Triangle read by rows: T(1,1) = 1; for n>=2, write the first n^2 integers in an n X n array beginning with 1 in the upper left proceeding left to right and top to bottom; then T(n,k) is the last prime in the k-th row.
%C There is a prime in each row.
%D Paulo Ribenboim, "The Little Book Of Big Primes," Springer-Verlag, NY 1991, page 185.
%e Triangle begins
%e 1;
%e 2, 3;
%e 3, 5, 7;
%e 3, 7, 11, 13;
%e 5, 7, 13, 19, 23;
%t PrevPrim[n_] := Block[{k = n - 1}, While[ !PrimeQ[k], k-- ]; k]; Table[ PrevPrim[i*n + 1], {n, 2, 12}, {i, 1, n}]
%Y Cf. A092556, A083415.
%K nonn,tabl
%O 1,2
%A _Robert G. Wilson v_, Feb 27 2004
|
