The OEIS is supported by the many generous donors to the OEIS Foundation.

Number of intermediate configurations needed to be stored to calculate the number of ways in which a 9 X n grid can be tiled with triominoes.

2

`%I #24 Feb 21 2020 20:08:34
`

`%S 4,360,4261,20104,44654,70166,95681,121196,146711,172226,197741,
`

`%T 223256,248771,274286,299801,325316,350831,376346,401861,427376,
`

`%U 452891,478406,503921,529436,554951,580466,605981,631496,657011,682526,708041,733556,759071,784586
`

`%N Number of intermediate configurations needed to be stored to calculate the number of ways in which a 9 X n grid can be tiled with triominoes.
`

`%C a(n+1) - a(n) = 25515, for all n >= 6.
`

`%H V. Raman, <a href="/A215827/b215827.txt">Table of n, a(n) for n = 1..42</a>
`

`%H Project Euler, <a href="http://projecteuler.net/problem=161">Problem #161: Triominoes</a>
`

`%Y Cf. A215826 (Number of ways in which a 9 X n grid can be tiled with triominoes).
`

`%K nonn
`

`%O 1,1
`

`%A _V. Raman_, Aug 23 2012
`

`%E Definition corrected by _V. Raman_, Oct 22 2012
`

`%E a(1) inserted and more terms a(23)-a(34) from _V. Raman_, Oct 24 2012
`