|
Search: id:A137193
|
|
|
| A137193 |
|
Number of n-celled polyhexes with perimeter < 4n+2. |
|
+0
1
|
|
| 0, 0, 1, 2, 10, 46, 215, 1037, 5083, 24918, 122437
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
COMMENT
|
These are n-cell polyhexes with the perimeter less than the maximum possible one.
If we associate a graph to a polyhex with vertices representing cells and edges representing two cells with a common edge, then this sequence enumerates polyhexes whose corresponding graphs have cycles.
|
|
FORMULA
|
A000228(n)-A038142(n)
|
|
CROSSREFS
|
Sequence in context: A080643 A032389 A106709 this_sequence A006213 A137635 A029706
Adjacent sequences: A137190 A137191 A137192 this_sequence A137194 A137195 A137196
|
|
KEYWORD
|
hard,more,nonn
|
|
AUTHOR
|
Tanya Khovanova (tanyakh(AT)yahoo.com), Mar 03 2008
|
|
|
Search completed in 0.002 seconds
|
