|
|
A294249
|
|
Minimum number of matchsticks required to make squares of size 1 X 1, 2 X 2, ..., n X n simultaneously.
|
|
2
|
|
|
0, 4, 10, 17, 26, 35, 45, 56, 69, 82, 95, 109, 125, 140, 156, 172, 190, 208, 226, 243, 264, 282, 300, 322, 340, 363, 388, 409, 435, 454, 480, 504, 528, 553, 581, 603, 629, 659, 684, 713, 740, 765, 795, 822, 843, 880, 909
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
Problem originally suggested by and first terms computed by Robert P. Vermillion Jr.
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.
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
|
|
LINKS
|
|
|
EXAMPLE
|
o - o - o
| | |
o - o o
| |
o - o - o
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|