A176560 - cp's OEIS frontend

A176560 A symmetrical triangle recursion:q=5;t(n,m,0)=Binomial[n,m];t(n,m,1)=Narayana(n,m);t(n,m,2)=Eulerian(n+1,m);t(n,m,q)=t(n,m,g-2)+t(n,m,q-3).

n	a(n)
0	1
1	1
2	1
3	1
4	6
5	1
6	1
7	16
8	16
9	1
10	1
11	35
12	85
13	35
14	1
15	1
16	71
17	351
18	351
19	71
20	1
21	1
22	140
23	1295
24	2590
25	1295
26	140
27	1
28	1
29	274
30	4488
31	16108
32	16108
33	4488
34	274
35	1
36	1
37	537
38	14943
39	89409
40	157953
41	89409
42	14943
43	537
44	1
45	1
46	1057
47	48379
48	457711
49	1315645
50	1315645
51	457711
52	48379

[1, 1, 1, 1, 6, 1, 1, 16, 16, 1, 1, 35, 85, 35, 1, 1, 71, 351, 351, 71, 1, 1, 140, 1295, 2590, 1295, 140, 1, 1, 274, 4488, 16108, 16108, 4488, 274, 1, 1, 537, 14943, 89409, 157953, 89409, 14943, 537, 1, 1, 1057, 48379, 457711, 1315645, 1315645, 457711, 48379]

cp's OEIS Frontend

A176560 A symmetrical triangle recursion:q=5;t(n,m,0)=Binomial[n,m];t(n,m,1)=Narayana(n,m);t(n,m,2)=Eulerian(n+1,m);t(n,m,q)=t(n,m,g-2)+t(n,m,q-3).

Table of values

List of values