|
|
A018835
|
|
Minimal number of smaller integer-sided squares that tile an n X n square.
|
|
4
|
|
|
4, 6, 4, 8, 4, 9, 4, 6, 4, 11, 4, 11, 4, 6, 4, 12, 4, 13, 4, 6, 4, 13, 4, 8, 4, 6, 4, 14, 4, 15, 4, 6, 4, 8, 4, 15, 4, 6, 4, 15, 4, 16, 4, 6, 4, 16, 4, 9, 4, 6, 4, 16, 4, 8, 4, 6, 4, 17, 4, 17, 4, 6, 4, 8, 4
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
2,1
|
|
COMMENTS
|
Sascha Kurz has found a(n) for n <= 104, and up to this point he observes that a(n) is given by a(n) = min{ a(p) | p prime, p divides n } (cf. A211302). - N. J. A. Sloane, Apr 07 2012
|
|
LINKS
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|