A143410 - cp's OEIS frontend

A143410 Form the difference table of the sequence {2^kk!}, then divide k-th column entries by 2^kk!. Array read by ascending antidiagonals, T(n, k) for n, k >= 0.

n	a(n)
0	1
1	1
2	1
3	5
4	3
5	1
6	29
7	17
8	5
9	1
10	233
11	131
12	37
13	7
14	1
15	2329
16	1281
17	353
18	65
19	9
20	1
21	27949
22	15139
23	4105
24	743
25	101
26	11
27	1
28	391285
29	209617
30	56189
31	10049
32	1349
33	145
34	13
35	1
36	6260561
37	3325923
38	883885
39	156679
40	20841
41	2219
42	197
43	15
44	1
45	112690097
46	59475329
47	15700313

[1, 1, 1, 5, 3, 1, 29, 17, 5, 1, 233, 131, 37, 7, 1, 2329, 1281, 353, 65, 9, 1, 27949, 15139, 4105, 743, 101, 11, 1, 391285, 209617, 56189, 10049, 1349, 145, 13, 1, 6260561, 3325923, 883885, 156679, 20841, 2219, 197, 15, 1, 112690097, 59475329, 15700313]

cp's OEIS Frontend

A143410 Form the difference table of the sequence {2^kk!}, then divide k-th column entries by 2^kk!. Array read by ascending antidiagonals, T(n, k) for n, k >= 0.

Table of values

List of values

cp's OEIS Frontend

A143410 Form the difference table of the sequence {2^k*k!}, then divide k-th column entries by 2^k*k!. Array read by ascending antidiagonals, T(n, k) for n, k >= 0.

Table of values

List of values

A143410 Form the difference table of the sequence {2^kk!}, then divide k-th column entries by 2^kk!. Array read by ascending antidiagonals, T(n, k) for n, k >= 0.