A331151 - OEIS

A331151

Triangle read by rows: T(n,k) (n>=k>=1) = ceiling((n/k)*floor(n/k)).

1, 4, 1, 9, 2, 1, 16, 4, 2, 1, 25, 5, 2, 2, 1, 36, 9, 4, 2, 2, 1, 49, 11, 5, 2, 2, 2, 1, 64, 16, 6, 4, 2, 2, 2, 1, 81, 18, 9, 5, 2, 2, 2, 2, 1, 100, 25, 10, 5, 4, 2, 2, 2, 2, 1, 121, 28, 11, 6, 5, 2, 2, 2, 2, 2, 1, 144, 36, 16, 9, 5, 4, 2, 2, 2, 2, 2, 1, 169, 39, 18, 10, 6, 5, 2, 2, 2, 2, 2, 2, 1

(list; table; graph; refs; listen; history; text; internal format)

OFFSET

1,2

LINKS

Table of n, a(n) for n=1..91.

Robert J. McEliece and Herbert Taylor, Covering tori with squares, Journal of Combinatorial Theory, Series A 14.1 (1973): 119-124.

EXAMPLE

Triangle begins:

4, 1,

9, 2, 1,

16, 4, 2, 1,

25, 5, 2, 2, 1,