login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A246437 Expansion of (1/2)*(1/(x+1)+1/(sqrt(-3*x^2-2*x+1))). 7
1, 0, 2, 3, 10, 25, 71, 196, 554, 1569, 4477, 12826, 36895, 106470, 308114, 893803, 2598314, 7567465, 22076405, 64498426, 188689685, 552675364, 1620567764, 4756614061, 13974168191, 41088418150, 120906613076, 356035078101, 1049120176954 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
a(2101) has 1001 decimal digits. - Michael De Vlieger, Apr 25 2016
This is the analog for Coxeter type B of Motzkin sums (A005043) for Coxeter type A, see the article by Athanasiadis and Savvidou. - F. Chapoton, Jul 20 2017
Number of compositions of n into exactly n nonnegative parts avoiding part 1. a(4) = 10: 0004, 0022, 0040, 0202, 0220, 0400, 2002, 2020, 2200, 4000. - Alois P. Heinz, Aug 19 2018
From Peter Bala, Jan 07 2022: (Start)
The binary transform is A088218. The inverse binomial transform is a signed version of A027306 and the second inverse binomial transform is a signed version of A027914.
The Gauss congruences a(n*p^k) == a(n^p^(k-1)) (mod p^k) hold for prime p and positive integers n and k.
Conjecture: the stronger congruences a(n*p^k) == a(n^p^(k-1)) (mod p^(2*k)) hold for prime p >= 5 and positive integers n and k. (End)
LINKS
Christos A. Athanasiadis and Christina Savvidou, The Local h-Vector of the Cluster Subdivision of a Simplex, Séminaire Lotharingien de Combinatoire 66 (2012), Article B66c.
Eric Marberg, On some actions of the 0-Hecke monoids of affine symmetric groups, arXiv:1709.07996 [math.CO], 2017.
FORMULA
a(n) = Sum_{k = 0..n/2} binomial(n,k)*binomial(n-k-1,n-2*k).
A(x) = 1 + x*B'(x)/B(x), where B(x) = (1+x-sqrt(1-2*x-3*x^2))/(2*x*(1+x)) is the o.g.f. of A005043.
a(n) = n*hypergeom([1-n, 1-n/2, 3/2-n/2],[2, 2-n], 4) for n>=3. - Peter Luschny, Nov 14 2014
a(n) ~ 3^(n+1/2) / (4*sqrt(Pi*n)). - Vaclav Kotesovec, Nov 14 2014
a(n) = (-1)^n*(hypergeom([1/2, -n], [1], 4) + 1)/2. - Vladimir Reshetnikov, Apr 25 2016
D-finite with recurrence: n*(a(n) - a(n-1)) = (5*n-6)*a(n-2) + 3*(n-2)*a(n-3). - Vladimir Reshetnikov, Oct 13 2016
a(n) = [x^n]( (1 - x + x^2)/(1 - x) )^n. - Peter Bala, Jan 07 2022
MATHEMATICA
CoefficientList[Series[(1/2) (1 / (x + 1) + 1 / (Sqrt[-3 x^2 - 2 x + 1])), {x, 0, 40}], x] (* Vincenzo Librandi, Nov 14 2014 *)
Table[(-1)^n (Hypergeometric2F1[1/2, -n, 1, 4] + 1)/2, {n, 0, 20}] (* Vladimir Reshetnikov, Apr 25 2016 *)
Table[Sum[Binomial[n, k] Binomial[n - k - 1, n - 2 k], {k, 0, n/2}], {n, 0, 28}] (* Michael De Vlieger, Apr 25 2016 *)
PROG
(Maxima)
a(n):=sum(binomial(n, k)*binomial(n-k-1, n-2*k), k, 0, n/2);
(Sage)
def a(n):
if n < 3: return [1, 0, 2][n]
return n*hypergeometric([1-n, 1-n/2, 3/2-n/2], [2, 2-n], 4)
[simplify(a(n)) for n in (0..28)] # Peter Luschny, Nov 14 2014
CROSSREFS
Sequence in context: A059929 A123029 A103018 * A341265 A005158 A370608
KEYWORD
nonn,easy
AUTHOR
Vladimir Kruchinin, Nov 14 2014
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 05:56 EDT 2024. Contains 371964 sequences. (Running on oeis4.)