|
Search: id:A061289
|
|
|
| A061289 |
|
Consider a network of triangles consisting of an equilateral triangle divided into n^2 equilateral triangles plus a circle connecting the vertices of the main triangle. Sequence gives minimal number of corner turns required to trace the network in one continuous line. |
|
+0
1
|
| |
|
|
OFFSET
|
1,1
|
|
|
REFERENCES
|
Martin Gardner, More Mathematical Puzzles and Diversions, page 63, "a network tracing puzzle".
|
|
EXAMPLE
|
a(1)=3 since you have to make two turns to trace the triangle and one to cover the circular part of the network.
|
|
CROSSREFS
|
Sequence in context: A067073 A124273 A038923 this_sequence A063226 A063239 A040106
Adjacent sequences: A061286 A061287 A061288 this_sequence A061290 A061291 A061292
|
|
KEYWORD
|
hard,nonn
|
|
AUTHOR
|
Brian Wallace (wallacebrianedward(AT)yahoo.co.uk), May 22 2001
|
|
|
Search completed in 0.002 seconds
|
