A112915 - cp's OEIS frontend

A112915 Recurrence: a(n) = Sum_{k=0..n-1} (k+1)(n-k)a(k)*a(n-k-1) for n>0, with a(0)=1.

n	a(n)
0	1
1	1
2	4
3	28
4	272
5	3312
6	47872
7	794880
8	14840064
9	306900736
10	6953989120
11	171200048128
12	4548965384192
13	129742326218752
14	3953689388187648
15	128215703582343168
16	4409347536459988992
17	160304460015345795072

[1, 1, 4, 28, 272, 3312, 47872, 794880, 14840064, 306900736, 6953989120, 171200048128, 4548965384192, 129742326218752, 3953689388187648, 128215703582343168, 4409347536459988992, 160304460015345795072]

cp's OEIS Frontend

A112915 Recurrence: a(n) = Sum_{k=0..n-1} (k+1)(n-k)a(k)*a(n-k-1) for n>0, with a(0)=1.

Table of values

List of values

cp's OEIS Frontend

A112915 Recurrence: a(n) = Sum_{k=0..n-1} (k+1)*(n-k)*a(k)*a(n-k-1) for n>0, with a(0)=1.

Table of values

List of values

A112915 Recurrence: a(n) = Sum_{k=0..n-1} (k+1)(n-k)a(k)*a(n-k-1) for n>0, with a(0)=1.