Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A137191
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A137191 Number of n-celled polyiamonds with perimeter < n+2. +0
1
0, 0, 0, 0, 0, 1, 1, 4, 11, 39, 120, 403, 1254, 4000, 12475, 39030 (list; graph; listen)
OFFSET

1,8

COMMENT

These are n-cell polyiamonds with the perimeter less than the maximum possible one.

If we associate a graph to a polyiamond with vertices representing cells and edges representing two cells with a common edge, then this sequence enumerates polyiamonds whose corresponding graphs have cycles.

FORMULA

A000577(n) - A131481(n)

CROSSREFS

Sequence in context: A149256 A149257 A050987 this_sequence A106269 A126758 A149258

Adjacent sequences: A137188 A137189 A137190 this_sequence A137192 A137193 A137194

KEYWORD

hard,more,nonn

AUTHOR

Tanya Khovanova (tanyakh(AT)yahoo.com), Mar 03 2008

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 13:47 EST 2009. Contains 167481 sequences.


AT&T Labs Research