Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A121555
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A121555 Number of 1-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
3
1, 2, 7, 32, 178, 1164, 8748, 74304, 704016, 7362720, 84255840, 1047358080, 14054739840, 202514376960, 3118666924800, 51119166873600, 888640952371200, 16330301780889600, 316322420114534400, 6441691128993792000 (list; graph; listen)
OFFSET

1,2

COMMENT

a(n)=Sum(k*A121554(n,k),k=0..n).

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*a(n-1)+(n-2)!*(n-2) for n>=2.

EXAMPLE

a(2)=2 because the deco polyominoes of height 2 are the vertical and horizontal dominoes, having, respectively, 0 and 2 columns with exactly 1 cell.

MAPLE

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

CROSSREFS

Cf. A121554.

Sequence in context: A005362 A059439 A006014 this_sequence A097900 A000153 A006154

Adjacent sequences: A121552 A121553 A121554 this_sequence A121556 A121557 A121558

KEYWORD

nonn

AUTHOR

Emeric Deutsch (deutsch(AT)duke.poly.edu), Aug 08 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 24 23:16 EST 2009. Contains 167481 sequences.


AT&T Labs Research