|
%I #2 Mar 30 2012 18:51:00
%S 0,1,2,2,2,2,3,2,3,2,3,4,2,2,3,4,4,2,4,2,3,5,3,4,3,3,4,2,5,5,4,3,4,2,
%T 5,2,6,4,5,4,4,4,2,4,3,7,4,5,5,3,5,4,3,4,5,7,6,4,5,6,3,4,4,5,2,6,8,6,
%U 5,4,6,4,5,4,4,5,4,5,8,6,6,6,4,5,6,4,5,4,6,3,4,8,7,7,6,5,5,5,4,6,5,4,4,5,5
%N Triangle read by rows: T(n,k) = number of primes in the k-th row of the square of the first n^2 odd numbers written consecutively in rows of length n, 1<=k<=n.
%C A139326(n) = Min{T(n,k): 1<=k<=n};
%C A139327(n) = Max{T(n,k): 1<=k<=n};
%C A139328(n) gives sums of rows;
%C T(n,1) = A099802(n) - 1.
%Y Cf. A083415.
%K nonn,tabl
%O 1,3
%A _Reinhard Zumkeller_, Apr 14 2008
|
