Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A131482
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A131482 a(n) is the number of n-celled polyominoes with perimeter 2n+2. +0
4
1, 1, 2, 4, 11, 27, 83, 255, 847, 2829, 9734, 33724, 118245 (list; graph; listen)
OFFSET

1,3

COMMENT

2n+2 is the maximal perimeter of an n-celled polyomino. a(n) is the number of n-celled polyominoes 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 Polyominoes

Poly Pages

CROSSREFS

a(n) <= A000105(n), a(n) <= A057730(n+1).

Sequence in context: A071314 A123441 A086441 this_sequence A099412 A100094 A099525

Adjacent sequences: A131479 A131480 A131481 this_sequence A131483 A131484 A131485

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 August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research