A349706 - cp's OEIS frontend

A349706 Square array T(n,k) = Sum_{j=0..k} binomial(k,j) * j^n for n and k >= 0, read by ascending antidiagonals.

n	a(n)
0	1
1	0
2	2
3	0
4	1
5	4
6	0
7	1
8	4
9	8
10	0
11	1
12	6
13	12
14	16
15	0
16	1
17	10
18	24
19	32
20	32
21	0
22	1
23	18
24	54
25	80
26	80
27	64
28	0
29	1
30	34
31	132
32	224
33	240
34	192
35	128
36	0
37	1
38	66
39	342
40	680
41	800
42	672
43	448
44	256
45	0
46	1
47	130
48	924
49	2192
50	2880
51	2592
52	1792
53	1024
54	512
55	0
56	1
57	258
58	2574
59	7400
60	11000
61	10752
62	7840
63	4608
64	2304
65	1024

[1, 0, 2, 0, 1, 4, 0, 1, 4, 8, 0, 1, 6, 12, 16, 0, 1, 10, 24, 32, 32, 0, 1, 18, 54, 80, 80, 64, 0, 1, 34, 132, 224, 240, 192, 128, 0, 1, 66, 342, 680, 800, 672, 448, 256, 0, 1, 130, 924, 2192, 2880, 2592, 1792, 1024, 512, 0, 1, 258, 2574, 7400, 11000, 10752, 7840, 4608, 2304, 1024]

cp's OEIS Frontend

A349706 Square array T(n,k) = Sum_{j=0..k} binomial(k,j) * j^n for n and k >= 0, read by ascending antidiagonals.

Table of values

List of values