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.

A068929 Number of incongruent ways to tile a 4 X n room with 1x2 Tatami mats. At most 3 Tatami mats may meet at a point.

Table of values

n a(n)
1 1
2 3
3 2
4 1
5 2
6 2
7 2
8 3
9 3
10 4
11 5
12 5
13 6
14 8
15 8
16 11
17 12
18 14
19 17
20 20
21 24
22 29
23 32
24 41
25 46
26 56
27 68
28 78
29 93
30 114
31 130
32 161
33 188
34 223
35 268
36 318
37 378
38 456
39 533
40 646
41 763
42 911
43 1092
44 1296
45 1542
46 1855
47 2190
48 2634
49 3133
50 3732
51 4463
52 5323
53 6339
54 7596
55 9022
56 10802
57 12876

List of values

[1, 3, 2, 1, 2, 2, 2, 3, 3, 4, 5, 5, 6, 8, 8, 11, 12, 14, 17, 20, 24, 29, 32, 41, 46, 56, 68, 78, 93, 114, 130, 161, 188, 223, 268, 318, 378, 456, 533, 646, 763, 911, 1092, 1296, 1542, 1855, 2190, 2634, 3133, 3732, 4463, 5323, 6339, 7596, 9022, 10802, 12876]