Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A131481
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A131481 a(n) is the number of n-cell polyiamonds (triangular polyominoes) with perimeter n+2. +0
4
1, 1, 1, 3, 4, 11, 23, 62, 149, 409, 1066, 2931, 7981, 22166, 61508, 172267 (list; graph; listen)
OFFSET

0,4

COMMENT

n+2 is the maximal perimeter for an n-celled polyiamond. a(n) is the number of n-celled polyiamonds that have a tree as their connectedness graph (vertices of this graph correspond to cells and two vertices are connected if the corresponding cells have a common edge)

LINKS

Isoperimetrical Polyiamonds

Poly Pages

CROSSREFS

a(n) <= A000577(n), a(n) <= A057729(n+2).

Sequence in context: A001642 A001643 A005218 this_sequence A001072 A077900 A041231

Adjacent sequences: A131478 A131479 A131480 this_sequence A131482 A131483 A131484

KEYWORD

hard,more,nonn

AUTHOR

Tanya Khovanova (tanyakh(AT)yahoo.com), Jul 27 2007

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research