OFFSET
1,3
COMMENTS
LINKS
Andrew Howroyd, Table of n, a(n) for n = 1..1000
Nicolle González, Pamela E. Harris, Gordon Rojas Kirby, Mariana Smit Vega Garcia, and Bridget Eileen Tenner, Pinnacle sets of signed permutations, arXiv:2301.02628 [math.CO] (2023).
FORMULA
a(n) = Sum_{k=0..floor((n-1)/2)} binomial(n,k)*binomial(n-1-k,floor((n-1)/2) - k).
a(n) = binomial(n-1, floor((n-1)/2))*hypergeom([-n, ceil((1 -n)/2)], [1 - n], -1). - Peter Luschny, Jan 03 2023
EXAMPLE
For n = 3, the a(3) = 5 admissible pinnacle sets in S_3^B are {}, {-1}, {1}, {2}, {3}.
MAPLE
a := n -> add(binomial(n, k)*binomial(n-1-k, iquo(n-1, 2) - k), k = 0..iquo(n-1, 2)):
# Alternative:
a := n -> binomial(n-1, floor((n-1)/2))*hypergeom([-n, ceil((1-n)/2)], [1-n], -1);
seq(simplify(a(n)), n=3..31); # Peter Luschny, Jan 03 2023
MATHEMATICA
Array[Sum[Binomial[#, k]*Binomial[# - 1 - k, Floor[(# - 1)/2] - k], {k, 0, Floor[(# - 1)/2]}] &, 31] (* Michael De Vlieger, Jan 03 2023 *)
PROG
(PARI) a(n) = sum(k=0, (n-1)\2, binomial(n, k)*binomial(n-1-k, (n-1)\2 - k)) \\ Andrew Howroyd, Jan 02 2023
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Bridget Tenner, Dec 15 2022
STATUS
approved