A026907 - cp's OEIS frontend

A026907 Triangular array T read by rows (9-diamondization of Pascal's triangle). Step 1: t(n,k) = sum of 9 entries in diamond-shaped subarray of Pascal's triangle having vertices C(n,k), C(n+4,k+2), C(n+2,k), C(n+2,k+2). Step 2: T(n,k) = t(n,k) - t(0,0) + 1.

n	a(n)
0	1
1	13
2	13
3	28
4	44
5	28
6	46
7	90
8	90
9	46
10	67
11	154
12	198
13	154
14	67
15	91
16	239
17	370
18	370
19	239
20	91
21	118
22	348
23	627
24	758
25	627
26	348
27	118
28	148
29	484
30	993
31	1403
32	1403
33	993
34	484
35	148
36	181
37	650
38	1495
39	2414
40	2824
41	2414
42	1495
43	650
44	181
45	217
46	849
47	2163
48	3927
49	5256
50	5256
51	3927
52	2163
53	849
54	217

[1, 13, 13, 28, 44, 28, 46, 90, 90, 46, 67, 154, 198, 154, 67, 91, 239, 370, 370, 239, 91, 118, 348, 627, 758, 627, 348, 118, 148, 484, 993, 1403, 1403, 993, 484, 148, 181, 650, 1495, 2414, 2824, 2414, 1495, 650, 181, 217, 849, 2163, 3927, 5256, 5256, 3927, 2163, 849, 217]

cp's OEIS Frontend

A026907 Triangular array T read by rows (9-diamondization of Pascal's triangle). Step 1: t(n,k) = sum of 9 entries in diamond-shaped subarray of Pascal's triangle having vertices C(n,k), C(n+4,k+2), C(n+2,k), C(n+2,k+2). Step 2: T(n,k) = t(n,k) - t(0,0) + 1.

Table of values

List of values