login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A344503 a(n) = Sum_{k=0..n} (-1)^(n-k)*binomial(n, k)^2*hypergeom([(k-n)/2, (k-n+1)/2], [k+2], 4). 1
1, 0, -1, 3, 0, -5, 15, 0, -28, 84, 0, -165, 495, 0, -1001, 3003, 0, -6188, 18564, 0, -38760, 116280, 0, -245157, 735471, 0, -1562275, 4686825, 0, -10015005, 30045015, 0, -64512240, 193536720, 0, -417225900, 1251677700, 0, -2707475148, 8122425444, 0, -17620076360 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

COMMENTS

Inverse binomial convolution of the Motzkin numbers.

LINKS

Table of n, a(n) for n=0..41.

FORMULA

a(3*n) = binomial(3*n, n) (A005809).

a(3*n - 1) = -binomial(3*n - 1, n - 1) (A025174).

a(3*n - 2) = 0.

Conjecture D-finite with recurrence -18*(2*n+1) *(2*n-1) *(n+1) *a(n) +2*(-36*n^3+554*n^2-1128*n+27) *a(n-1) +6*(-12*n^3-188*n^2+1235*n-1618) *a(n-2) +9*(54*n^3-27*n^2-183*n+320) *a(n-3) +54*(n-3) *(9*n^2-125*n+75) *a(n-4) +81 *(n-3) *(n-4) *(6*n+127) *a(n-5)=0. - R. J. Mathar, Nov 02 2021

MAPLE

a := n -> add((-1)^(n - k)*binomial(n, k)^2*hypergeom([(k-n)/2, (k-n+1)/2], [k+2], 4), k = 0..n): seq(simplify(a(n)), n = 0..41);

CROSSREFS

Cf. A064189 (Motzkin numbers), A005809, A025174, A344502.

Sequence in context: A022837 A328631 A225950 * A088969 A009780 A175677

Adjacent sequences:  A344500 A344501 A344502 * A344504 A344505 A344506

KEYWORD

sign

AUTHOR

Peter Luschny, May 23 2021

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 5 17:28 EST 2021. Contains 349557 sequences. (Running on oeis4.)