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.

A339494 T(n, k) is the number of domino towers of n bricks with height at most 3 and k bricks in the base floor. Triangle read by rows, T(n, k) for 1 <= k <= n.

Table of values

n a(n)
1 1
2 2
3 1
4 5
5 3
6 1
7 5
8 9
9 4
10 1
11 3
12 14
13 14
14 5
15 1
16 1
17 16
18 29
19 20
20 6
21 1
22 0
23 12
24 46
25 51
26 27
27 7
28 1
29 0
30 5
31 52
32 101
33 81
34 35
35 8
36 1
37 0
38 1
39 41
40 150
41 190
42 120
43 44
44 9
45 1
46 0
47 0
48 22
49 169
50 345
51 323
52 169
53 54
54 10
55 1
56 0
57 0
58 7
59 143
60 495
61 687
62 511
63 229
64 65
65 11
66 1

List of values

[1, 2, 1, 5, 3, 1, 5, 9, 4, 1, 3, 14, 14, 5, 1, 1, 16, 29, 20, 6, 1, 0, 12, 46, 51, 27, 7, 1, 0, 5, 52, 101, 81, 35, 8, 1, 0, 1, 41, 150, 190, 120, 44, 9, 1, 0, 0, 22, 169, 345, 323, 169, 54, 10, 1, 0, 0, 7, 143, 495, 687, 511, 229, 65, 11, 1]