cp's OEIS Frontend

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.

A227959 Number of tilings using monominoes and L-trominoes in 2 X n chessboard, such that three monominoes cannot occur together in shape of L-tromino.

Table of values

n a(n)
0 1
1 1
2 4
3 6
4 20
5 38
6 104
7 220
8 556
9 1244
10 3024
11 6944
12 16576
13 38536
14 91216
15 213280
16 502864
17 1178928
18 2774592
19 6512864
20 15315072
21 35969952
22 84550912
23 198634048
24 466825152
25 1096838208
26 2577550336
27 6056474880
28 14232064256
29 33441977216
30 78583660288
31 184655188480

List of values

[1, 1, 4, 6, 20, 38, 104, 220, 556, 1244, 3024, 6944, 16576, 38536, 91216, 213280, 502864, 1178928, 2774592, 6512864, 15315072, 35969952, 84550912, 198634048, 466825152, 1096838208, 2577550336, 6056474880, 14232064256, 33441977216, 78583660288, 184655188480]