|
|
A089047
|
|
Edge length of largest square dissectable into up to n squares in Mrs. Perkins's quilt problem.
|
|
7
|
|
|
1, 1, 1, 2, 2, 3, 4, 5, 7, 9, 13, 17, 23, 29, 41, 53, 70, 91, 126, 158, 216, 276, 386, 488, 675, 866, 1179, 1544, 2136, 2739, 3755, 4988, 6443
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,4
|
|
COMMENTS
|
More precisely, a(n) = greatest k such that A005670(k) <= n. - Peter Munn, Mar 13 2018
Terms up to and including a(18) have been proved correct by Ed Wynn (2013). - Stuart E Anderson, Sep 16 2013
Further best known terms are 8568, 11357, 14877, 19594, 26697, 34632. - Ed Pegg Jr, Jul 06 2017
A290821 is the equivalent sequence for equilateral triangles. - Peter Munn, Mar 06 2018
|
|
LINKS
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,hard,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
Conjectured terms have been extended up to a(44), based on simple squared square enumeration, by Duijvestijn, Skinner, Anderson, Pegg, Johnson, Milla and Williams. - Stuart E Anderson, Sep 16 2013
a(33) and further terms added by Ed Pegg Jr, Jul 06 2017
|
|
STATUS
|
approved
|
|
|
|