login
Least k such that there exists a square of side length sqrt(A001481(n)) with vertices in a k X k square array of points.
1

%I #14 Oct 30 2019 02:23:40

%S 2,3,3,4,5,4,5,6,5,6,7,7,6,7,8,9,9,7,8,9,10,10,8,9,11,10,11,12,9,10,

%T 11,13,12,13,13,10,11,12,14,13,14,15,11,12,13,15,14,16,15,16,12,13,14,

%U 17,15,17,16,13,14,17,15,18,16,18,17,19,19,14,15,16,17

%N Least k such that there exists a square of side length sqrt(A001481(n)) with vertices in a k X k square array of points.

%H Peter Kagey, <a href="/A328801/b328801.txt">Table of n, a(n) for n = 2..10000</a>

%F a(n) = A328803(n) + 1.

%e For n = 8, there is a square with side length sqrt(A001481(8)) = sqrt(10) and vertices in the a(8) X a(8) = 5 X 5 square array of points.

%e o o o * o

%e * o o o o

%e o o o o o

%e o o o o *

%e o * o o o

%e However, there is no square with side length sqrt(10) and vertices in a smaller square array points.

%Y Cf. A001481, A108279.

%Y A328793 is the analog for a triangular grid.

%K nonn,look

%O 2,1

%A _Peter Kagey_, Oct 27 2019