A027170 - cp's OEIS frontend

A027170 Triangular array T read by rows (4-diamondization of Pascal's triangle). Step 1: t(n,k) = C(n+2,k+1) + C(n+1,k) + C(n+1,k+1) + C(n,k). Step 2: T(n,k) = t(n,k) - t(0,0) + 1. Domain: 0 <= k <= n, n >= 0.

n	a(n)
0	1
1	3
2	3
3	5
4	10
5	5
6	7
7	19
8	19
9	7
10	9
11	30
12	42
13	30
14	9
15	11
16	43
17	76
18	76
19	43
20	11
21	13
22	58
23	123
24	156
25	123
26	58
27	13
28	15
29	75
30	185
31	283
32	283
33	185
34	75
35	15
36	17
37	94
38	264
39	472
40	570
41	472
42	264
43	94
44	17
45	19
46	115
47	362
48	740
49	1046
50	1046
51	740
52	362
53	115
54	19
55	21
56	138
57	481
58	1106
59	1790
60	2096
61	1790
62	1106
63	481
64	138
65	21

[1, 3, 3, 5, 10, 5, 7, 19, 19, 7, 9, 30, 42, 30, 9, 11, 43, 76, 76, 43, 11, 13, 58, 123, 156, 123, 58, 13, 15, 75, 185, 283, 283, 185, 75, 15, 17, 94, 264, 472, 570, 472, 264, 94, 17, 19, 115, 362, 740, 1046, 1046, 740, 362, 115, 19, 21, 138, 481, 1106, 1790, 2096, 1790, 1106, 481, 138, 21]

cp's OEIS Frontend

A027170 Triangular array T read by rows (4-diamondization of Pascal's triangle). Step 1: t(n,k) = C(n+2,k+1) + C(n+1,k) + C(n+1,k+1) + C(n,k). Step 2: T(n,k) = t(n,k) - t(0,0) + 1. Domain: 0 <= k <= n, n >= 0.

Table of values

List of values