Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A121582
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A121582 Number of cells in column 2 of all deco polyominoes of height n. A deco polyomino is a directed column-convex polyomino in which the height, measured along the diagonal, is attained only in the last column. +0
3
0, 1, 7, 40, 252, 1837, 15259, 141798, 1455694, 16360387, 199845957, 2637020884, 37388864368, 566971338009, 9157693715407, 156975522127762, 2846305448882274, 54432896145210943, 1095019542858729769 (list; graph; listen)
OFFSET

1,3

COMMENT

a(n)=Sum(k*A121581(n,k),k=0..n-1).

REFERENCES

E. Barcucci, A. Del Lungo and R. Pinzani, "Deco" polyominoes, permutations and random generation, Theoretical Computer Science, 159, 1996, 29-42.

FORMULA

a(1)=0, a(2)=1, a(n)=[(2n-3)a(n-1)-(n-1)a(n-2)+(n-1)!(n-2)(n^2-3n+4)/2]/(n-2) for n>=3.

EXAMPLE

a(2)=1 because the deco polyominoes of height 2 are the vertical and horizontal dominoes, having, respectively, 0 and 1 cells in their second columns.

MAPLE

a:=proc(n) if n=1 then 0 elif n=2 then 1 else ((2*n-3)*a(n-1)-(n-1)*a(n-2)+(n-1)!*(n-2)*(n^2-3*n+4)/2)/(n-2) fi end: seq(a(n), n=1..22);

CROSSREFS

Cf. A121580, A121581, A121584.

Sequence in context: A099459 A051814 A154968 this_sequence A062727 A165397 A123747

Adjacent sequences: A121579 A121580 A121581 this_sequence A121583 A121584 A121585

KEYWORD

nonn

AUTHOR

Emeric Deutsch (deutsch(AT)duke.poly.edu), Aug 11 2006

page 1

Search completed in 0.007 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 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research