Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093119
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A093119 Number of convex polyominoes with a 3 x n+1 minimal bounding rectangle. +0
2
13, 68, 222, 555, 1171, 2198, 3788, 6117, 9385, 13816, 19658, 27183, 36687, 48490, 62936, 80393, 101253, 125932, 154870, 188531, 227403, 271998, 322852, 380525, 445601, 518688, 600418, 691447, 792455, 904146, 1027248, 1162513 (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

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

(1/6) (6n^4 + 20n^3 + 27n^2 + 19n + 6).

CROSSREFS

Row 2 of triangle A093118.

Sequence in context: A086689 A141956 A137720 this_sequence A137188 A055338 A055880

Adjacent sequences: A093116 A093117 A093118 this_sequence A093120 A093121 A093122

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 July 23 17:35 EDT 2008. Contains 142285 sequences.


AT&T Labs Research