Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A007808
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A007808 Number of directed column-convex polyominoes of height n: a(k+1)=(k+1)*a(k)+(a(1)+...+a(k)). +0
10
1, 3, 13, 69, 431, 3103, 25341, 231689, 2345851, 26065011, 315386633, 4128697741, 58145826519, 876660153671, 14089181041141, 240455356435473, 4343224875615731, 82776756452911579, 1660133837750060001 (list; graph; listen)
OFFSET

1,2

REFERENCES

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

E. Barcucci, A. Del Lungo, R. Pinzani and R. Sprugnoli, La hauteur des polyominos dirige's verticalement convexes, Actes du 31e Se'minaire Lotharingien de Combinatoire, Publi. IRMA, Universite' Strasbourg I (1993).

LINKS

E. Barcucci, A. Del Lungo, R. Pinzani and R. Sprugnoli, La hauteur des polyominos...

FORMULA

a(n) = (n^2*a(n-1)-1)/(n-1). - Vladeta Jovovic (vladeta(AT)eunet.rs), Apr 26 2003

a(n)=n!*n*[1-Sum(1/j/(j+1)/(j+1)!, j=1..n-1)). - Emeric Deutsch (deutsch(AT)duke.poly.edu), Aug 07 2006

MAPLE

a:=n->n!*n*(1-add(1/j/(j+1)/(j+1)!, j=1..n-1)): seq(a(n), n=1..22); - Emeric Deutsch (deutsch(AT)duke.poly.edu), Aug 07 2006

CROSSREFS

First differences of A056542.

Sequence in context: A067145 A088714 A088368 this_sequence A104989 A119906 A059726

Adjacent sequences: A007805 A007806 A007807 this_sequence A007809 A007810 A007811

KEYWORD

nonn

AUTHOR

Paul.Zimmermann(AT)loria.fr

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 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research