The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A275599 Triangle read by rows: T(n,k) = number of right-skewed domino towers with n dominoes having a base of k dominoes placed end-to-end. 2
 1, 3, 1, 7, 4, 1, 15, 12, 4, 1, 31, 27, 13, 4, 1, 63, 61, 34, 13, 4, 1, 127, 124, 77, 35, 13, 4, 1, 255, 258, 165, 86, 35, 13, 4, 1, 511, 513, 348, 185, 87, 35, 13, 4, 1, 1023, 1039, 698, 399, 196, 87, 35, 13, 4, 1, 2047, 2062, 1410, 811, 423, 197, 87, 35, 13, 4, 1 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 2,2 COMMENTS Domino towers are created by stacking domino blocks horizontally on a convex base of k dominoes.  A right-skewed domino tower is a parallelogram domino tower such that at least one column of the polyomino is to the right of the base. LINKS T. M. Brown Convex domino towers, arXiv:1608.01562 [math.CO], (2016) FORMULA T(n,k) = Sum_{i=1..k} 2*T(n-k,i)+A(n-k,i) where A(n,k) is given by A275204 and with initial conditions T(n+1,n)=1 and T(n,k)=0 if n<2 and k<1, or n=1. Cf. A275204. Sequence in context: A086272 A104709 A110814 * A210038 A319076 A286513 Adjacent sequences:  A275596 A275597 A275598 * A275600 A275601 A275602 KEYWORD nonn,tabl AUTHOR Tricia Muldoon Brown, Aug 03 2016 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified February 23 12:38 EST 2020. Contains 332159 sequences. (Running on oeis4.)