This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A215827 #24 Feb 21 2020 20:08:34 %S A215827 4,360,4261,20104,44654,70166,95681,121196,146711,172226,197741, %T A215827 223256,248771,274286,299801,325316,350831,376346,401861,427376, %U A215827 452891,478406,503921,529436,554951,580466,605981,631496,657011,682526,708041,733556,759071,784586 %N A215827 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 A215827 a(n+1) - a(n) = 25515, for all n >= 6. %H A215827 V. Raman, <a href="/A215827/b215827.txt">Table of n, a(n) for n = 1..42</a> %H A215827 Project Euler, <a href="http://projecteuler.net/problem=161">Problem #161: Triominoes</a> %Y A215827 Cf. A215826 (Number of ways in which a 9 X n grid can be tiled with triominoes). %K A215827 nonn %O A215827 1,1 %A A215827 _V. Raman_, Aug 23 2012 %E A215827 Definition corrected by _V. Raman_, Oct 22 2012 %E A215827 a(1) inserted and more terms a(23)-a(34) from _V. Raman_, Oct 24 2012