A215826 Number of ways in which a 9 X n grid can be tiled with trominoes.

1, 1, 41, 3127, 41813, 1269900, 45832761, 1064557805, 30860212081, 928789262080, 25020222581494, 714819627084057, 20574308184277971, 576115800837801057, 16381774291037991059, 466431115279461257920, 13190758349044182698371, 374524994697062170913555

Offset

0,3

Links

Alois P. Heinz, Table of n, a(n) for n = 0..700 (terms n = 1..42 from V. Raman)

Project Euler, Problem 161: Triominoes.

Crossrefs

Cf. A215827 (number of memoizations needed to calculate a(n)), A134438, A233290, A269664.

Column k=9 of A233320.

Sequence in context: A223004 A275093 A275349 * A167246 A208564 A209097

Adjacent sequences: A215823 A215824 A215825 * A215827 A215828 A215829

Keyword

nonn

Author

V. Raman, Aug 23 2012

Status

approved