Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093120
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A093120 Number of convex polyominoes with a n+1 x n+1 minimal bounding square. +0
2
5, 68, 1110, 19010, 329126, 5693968, 98074332, 1680306750, 28638104550, 485731377560, 8202665891316, 137983709713668, 2313146752430780, 38658742468243520, 644327268137066104, 10712855104602481206 (list; table; graph; listen)
OFFSET

1,1

LINKS

V. J. W. Guo and J. Zeng, The number of convex polyominoes and the generating function of Jacobi polynomials.

FORMULA

(2+n)/2*C(4n, 2n) - n*C(2n, n)^2, n>0.

CROSSREFS

Main diagonal of triangle A093118.

Adjacent sequences: A093117 A093118 A093119 this_sequence A093121 A093122 A093123

Sequence in context: A003361 A099334 A029812 this_sequence A092817 A051538 A034944

KEYWORD

nonn,tabl

AUTHOR

Ralf Stephan, Mar 21 2004

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 October 13 09:05 EDT 2008. Contains 145008 sequences.


AT&T Labs Research