A176561 - cp's OEIS frontend

A176561 A symmetrical triangle recursion:q=6;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	7
5	1
6	1
7	18
8	18
9	1
10	1
11	38
12	90
13	38
14	1
15	1
16	75
17	360
18	360
19	75
20	1
21	1
22	145
23	1309
24	2609
25	1309
26	145
27	1
28	1
29	280
30	4508
31	16142
32	16142
33	4508
34	280
35	1
36	1
37	544
38	14970
39	89464
40	158022
41	89464
42	14970
43	544
44	1
45	1
46	1065
47	48414
48	457794
49	1315770
50	1315770
51	457794
52	48414

[1, 1, 1, 1, 7, 1, 1, 18, 18, 1, 1, 38, 90, 38, 1, 1, 75, 360, 360, 75, 1, 1, 145, 1309, 2609, 1309, 145, 1, 1, 280, 4508, 16142, 16142, 4508, 280, 1, 1, 544, 14970, 89464, 158022, 89464, 14970, 544, 1, 1, 1065, 48414, 457794, 1315770, 1315770, 457794, 48414]

cp's OEIS Frontend

A176561 A symmetrical triangle recursion:q=6;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