A139325 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.

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, 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, 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

Offset: 1

Author

Reinhard Zumkeller, Apr 14 2008

Keywords

• nonn
• tabl

Comments

A139326(n) = Min{T(n,k): 1<=k<=n};

A139327(n) = Max{T(n,k): 1<=k<=n};

A139328(n) gives sums of rows;

T(n,1) = A099802(n) - 1.

Crossrefs

Cf. A083415.