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.

A334058 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 5n.

Table of values

n a(n)
0 1
1 0
2 1
3 121
4 4
5 1
6 124760
7 1347
8 18
9 1
10 486854621
11 2001548
12 8154
13 52
14 1
15 5184423824705
16 10231953233
17 17045774
18 35542
19 121
20 1
21 123243726413573515
22 134835947255262
23 112619668659
24 102416812
25 124881
26 246
27 1
28 5717986519188343198259
29 3821094862609800013
30 1820735766620673
31 863827126967
32 486979381
33 375627
34 455
35 1

List of values

[1, 0, 1, 121, 4, 1, 124760, 1347, 18, 1, 486854621, 2001548, 8154, 52, 1, 5184423824705, 10231953233, 17045774, 35542, 121, 1, 123243726413573515, 134835947255262, 112619668659, 102416812, 124881, 246, 1, 5717986519188343198259, 3821094862609800013, 1820735766620673, 863827126967, 486979381, 375627, 455, 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.