Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A162677
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A162677 Number of different fixed (possibly) disconnected polyominoes (of any area) bounded (not necessarily tightly) by an n*n square +0
6
1, 10, 400, 57856, 31522816, 66605547520, 554222579875840, 18303191835587117056, 2408425353007592768536576, 1265177138001297870205254369280, 2655861110791164560222750369099284480 (list; graph; listen)
OFFSET

1,2

FORMULA

a(n)=2^(n^2)-2*2^((n-1)*n)+2^((n-1)^2)

EXAMPLE

a(2)=10: the monomino, 4 dominoes (2 strictly disconnected), 4 rotations of the L tromino, and the square tetromino

CROSSREFS

Cf. A162673, A162674, A162675, A162676

Sequence in context: A013402 A013406 A098722 this_sequence A041767 A130557 A085000

Adjacent sequences: A162674 A162675 A162676 this_sequence A162678 A162679 A162680

KEYWORD

nonn

AUTHOR

David Bevan (dbevan(AT)emtex.com), Jul 27 2009

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 December 11 12:57 EST 2009. Contains 170656 sequences.


AT&T Labs Research