login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A121635 Number of deco polyominoes of height n, having no 2-cell columns starting at level 0. A deco polyomino is a directed column-convex polyomino in which the height, measured along the diagonal, is attained only in the last column. 1
1, 2, 8, 42, 264, 1920, 15840, 146160, 1491840, 16692480, 203212800, 2674425600, 37841126400, 572885913600, 9240898867200, 158228598528000, 2866422214656000, 54775863926784000, 1101208277385216000 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

a(n)=A121634(n,0).

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)=1, a(n)=(n-2)!(n^2-3n+4)/2 for n>=2. a(1)=1, a(2)=1, a(n)=(n-2)[(n-2)! + a(n-1)] for n>=3.

EXAMPLE

a(2)=1 because the deco polyominoes of height 2 are the horizontal and vertical dominoes and the horizontal one has no 2-cell column starting at level 0.

MAPLE

a:=n->(n^2-3*n+4)*(n-2)!/2: seq(a(n), n=2..23);

CROSSREFS

Cf. A121634, A001710.

Sequence in context: A054993 A188912 A005315 * A002874 A078592 A052646

Adjacent sequences:  A121632 A121633 A121634 * A121636 A121637 A121638

KEYWORD

nonn

AUTHOR

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 08:51 EST 2012. Contains 205894 sequences.