Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A121635
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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. +0
2
1, 2, 8, 42, 264, 1920, 15840, 146160, 1491840, 16692480, 203212800, 2674425600, 37841126400, 572885913600, 9240898867200, 158228598528000, 2866422214656000, 54775863926784000, 1101208277385216000 (list; graph; listen)
OFFSET

1,2

COMMENT

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.

Adjacent sequences: A121632 A121633 A121634 this_sequence A121636 A121637 A121638

Sequence in context: A130649 A054993 A005315 this_sequence A002874 A078592 A052646

KEYWORD

nonn

AUTHOR

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

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 November 8 20:39 EST 2009. Contains 166234 sequences.


AT&T Labs Research