A359762 - cp's OEIS frontend

A359762 Array read by ascending antidiagonals. T(n, k) = n![x^n] exp(x + (k/2) x^2). A generalization of the number of involutions (or of 'telephone numbers').

n	a(n)
0	1
1	1
2	1
3	1
4	1
5	1
6	1
7	2
8	1
9	1
10	1
11	4
12	3
13	1
14	1
15	1
16	10
17	7
18	4
19	1
20	1
21	1
22	26
23	25
24	10
25	5
26	1
27	1
28	1
29	76
30	81
31	46
32	13
33	6
34	1
35	1
36	1
37	232
38	331
39	166
40	73
41	16
42	7
43	1
44	1
45	1
46	764
47	1303
48	856
49	281
50	106
51	19
52	8
53	1
54	1
55	1
56	2620
57	5937
58	3844
59	1741
60	426
61	145
62	22
63	9
64	1
65	1

[1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 4, 3, 1, 1, 1, 10, 7, 4, 1, 1, 1, 26, 25, 10, 5, 1, 1, 1, 76, 81, 46, 13, 6, 1, 1, 1, 232, 331, 166, 73, 16, 7, 1, 1, 1, 764, 1303, 856, 281, 106, 19, 8, 1, 1, 1, 2620, 5937, 3844, 1741, 426, 145, 22, 9, 1, 1]

cp's OEIS Frontend

A359762 Array read by ascending antidiagonals. T(n, k) = n![x^n] exp(x + (k/2) x^2). A generalization of the number of involutions (or of 'telephone numbers').

Table of values

List of values

cp's OEIS Frontend

A359762 Array read by ascending antidiagonals. T(n, k) = n!*[x^n] exp(x + (k/2) * x^2). A generalization of the number of involutions (or of 'telephone numbers').

Table of values

List of values

A359762 Array read by ascending antidiagonals. T(n, k) = n![x^n] exp(x + (k/2) x^2). A generalization of the number of involutions (or of 'telephone numbers').