cp's OEIS Frontend

A294249 Minimum number of matchsticks required to make squares of size 1 X 1, 2 X 2, ..., n X n simultaneously.

%I A294249 #33 Aug 04 2018 03:15:35
%S A294249 0,4,10,17,26,35,45,56,69,82,95,109,125,140,156,172,190,208,226,243,
%T A294249 264,282,300,322,340,363,388,409,435,454,480,504,528,553,581,603,629,
%U A294249 659,684,713,740,765,795,822,843,880,909
%N A294249 Minimum number of matchsticks required to make squares of size 1 X 1, 2 X 2, ..., n X n simultaneously.
%C A294249 Problem originally suggested by and first terms computed by Robert P. Vermillion Jr.
%C A294249 These are the result of computer searches, and while all efforts have been made to ensure that they are in fact the minimum, some chance remains that smaller values may be found.
%C A294249 Upper bounds for a(47)-a(63) are 939, 968, 999, 1030, 1061, 1093, 1122, 1157, 1186, 1217, 1250, 1281, 1311, 1350, 1383, 1417, 1451. - _Benjamin Chaffin_, Aug 03 2018
%H A294249 Benjamin Chaffin, <a href="/A294249/a294249.txt">Optimal solutions up to n=46, and best known up to n=63</a>
%e A294249 Illustration for a(2) = 10 from _N. J. A. Sloane_, Oct 30 2017
%e A294249 o - o - o
%e A294249 |   |   |
%e A294249 o - o   o
%e A294249 |       |
%e A294249 o - o - o
%K A294249 nonn,more
%O A294249 0,2
%A A294249 _Colin D Wright_, Oct 26 2017
%E A294249 Confirmed a(0)-a(29) and extended to a(46) by _Benjamin Chaffin_, Aug 03 2018