|
| |
|
|
A354763
|
|
a(n) is the minimum number of square tiles needed for constructing a figure whose corresponding graph has n cycles.
|
|
2
|
|
|
|
0, 4, 7, 6, 9, 12, 8, 11, 14, 13, 10, 13, 16, 15, 18, 12, 15, 18, 17, 20, 23, 14, 17, 20, 19, 22, 25, 21, 16, 19, 22, 21, 24, 27, 23, 26, 18, 21, 24, 23, 26, 29, 25, 28, 31, 20, 23, 26, 25, 28, 31, 27, 30, 33, 32, 22, 25, 28, 27, 30, 33, 29, 32, 35, 34, 31, 24
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
0,2
|
|
|
COMMENTS
|
The square tiles are connected only at corners.
|
|
|
LINKS
|
|
|
|
FORMULA
|
|
|
|
MATHEMATICA
|
r[n_]:=First[IntegerPartitions[n, All, Table[k(k+1)/2, {k, Sqrt[1+8n]}]]]; (* A354762 *)
Join[{0}, Table[1+Sum[Sqrt[1+8Part[r[n], i]], {i, Length[r[n]]}], {n, 66}]]
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
nonn,easy
|
|
|
AUTHOR
|
|
|
|
STATUS
|
approved
|
| |
|
|
