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.

A334057 Triangle read by rows: T(n,k) is the number of configurations with exactly k polyomino matchings in a generalized game of memory played on the path of length 4n.

Table of values

n a(n)
0 1
1 0
2 1
3 31
4 3
5 1
6 5474
7 288
8 12
9 1
10 2554091
11 72026
12 1476
13 31
14 1
15 2502018819
16 43635625
17 508610
18 5505
19 65
20 1
21 4456194509950
22 52673302074
23 394246455
24 2559565
25 16710
26 120
27 1
28 13077453070386914
29 111562882654972
30 580589062179
31 2504572910
32 10288390
33 43806
34 203
35 1

List of values

[1, 0, 1, 31, 3, 1, 5474, 288, 12, 1, 2554091, 72026, 1476, 31, 1, 2502018819, 43635625, 508610, 5505, 65, 1, 4456194509950, 52673302074, 394246455, 2559565, 16710, 120, 1, 13077453070386914, 111562882654972, 580589062179, 2504572910, 10288390, 43806, 203, 1]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.