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.

A059056 Penrice Christmas gift numbers, Card-matching numbers (Dinner-Diner matching numbers): Triangle T(n,k) = number of ways to get k matches for a deck with n cards, 2 of each kind.

Table of values

n a(n)
0 1
1 0
2 0
3 1
4 1
5 0
6 4
7 0
8 1
9 10
10 24
11 27
12 16
13 12
14 0
15 1
16 297
17 672
18 736
19 480
20 246
21 64
22 24
23 0
24 1
25 13756
26 30480
27 32365
28 21760
29 10300
30 3568
31 970
32 160
33 40
34 0
35 1
36 925705
37 2016480
38 2116836
39 1418720
40 677655
41 243360
42 67920
43 14688
44 2655
45 320
46 60
47 0
48 1

List of values

[1, 0, 0, 1, 1, 0, 4, 0, 1, 10, 24, 27, 16, 12, 0, 1, 297, 672, 736, 480, 246, 64, 24, 0, 1, 13756, 30480, 32365, 21760, 10300, 3568, 970, 160, 40, 0, 1, 925705, 2016480, 2116836, 1418720, 677655, 243360, 67920, 14688, 2655, 320, 60, 0, 1]