Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A121639
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A121639 Number of 2-cell columns in 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
2
0, 1, 5, 25, 147, 996, 7668, 66264, 635976, 6717600, 77482080, 969338880, 13076778240, 189261999360, 2925629280000, 48111515827200, 838731380659200, 15451544605593600, 299960798422118400, 6120505381423104000 (list; graph; listen)
OFFSET

1,3

COMMENT

a(n)=Sum(k*A121637(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(3)=5, a(n)=na(n-1)+(n-1)!-(n-3)! for n>=4.

EXAMPLE

a(2)=1 because the deco polyominoes of height 2 are the horizontal and vertical dominoes and only the vertical one has one 2-cell column.

MAPLE

a[1]:=0: a[2]:=1: a[3]:=5: for n from 4 to 43 do a[n]:=n*a[n-1]+(n-1)!-(n-3)! od: seq(a[n], n=1..23);

CROSSREFS

Cf. A121637, A121555.

Sequence in context: A064311 A114870 A049427 this_sequence A098349 A098212 A002050

Adjacent sequences: A121636 A121637 A121638 this_sequence A121640 A121641 A121642

KEYWORD

nonn

AUTHOR

Emeric Deutsch (deutsch(AT)duke.poly.edu), Aug 14 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 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research