OFFSET
0,3
COMMENTS
Analog of A275166 with Motzkin numbers replacing connected graph counts.
LINKS
Alois P. Heinz, Table of n, a(n) for n = 0..1000
FORMULA
a(2n+1) = A275207(2n+1).
MAPLE
b:= proc(n) option remember; `if`(n<2, 1,
((3*(n-1))*b(n-2)+(1+2*n)*b(n-1))/(n+2))
end:
a:= proc(n) option remember; add(b(j)*b(n-j), j=0..n/2)-
`if`(n::odd, 0, (t-> t*(t+1)/2)(b(n/2)))
end:
seq(a(n), n=0..40); # Alois P. Heinz, Jul 19 2016
MATHEMATICA
b[n_] := b[n] = If[n<2, 1, ((3*(n-1))*b[n-2] + (1+2*n)*b[n-1])/(n+2)];
a[n_] := a[n] = Sum[b[j]*b[n-j], {j, 0, n/2}] - If[OddQ[n], 0, Function[t, t*(t + 1)/2][b[n/2]]];
Table[a[n], {n, 0, 40}] (* Jean-François Alcover, May 16 2017, after Alois P. Heinz *)
CROSSREFS
KEYWORD
nonn
AUTHOR
R. J. Mathar, Jul 19 2016
STATUS
approved