|
| |
|
|
A005807
|
|
Sum of adjacent Catalan numbers.
(Formerly M0850)
|
|
19
|
|
|
|
2, 3, 7, 19, 56, 174, 561, 1859, 6292, 21658, 75582, 266798, 950912, 3417340, 12369285, 45052515, 165002460, 607283490, 2244901890, 8331383610, 31030387440, 115948830660, 434542177290, 1632963760974, 6151850548776
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
0,1
|
|
|
COMMENTS
|
The aerated sequence has Hankel transform F(n+2)*F(n+3) (A001654(n+2)). - Paul Barry, Nov 04 2008
|
|
|
REFERENCES
|
D. E. Knuth, personal communication.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
|
LINKS
|
Vincenzo Librandi, Table of n, a(n) for n = 0..200
Daniel Birmajer, Juan B. Gil, Michael D. Weiner, On rational Dyck paths and the enumeration of factor-free Dyck words, arXiv:1606.02183 [math.CO], (7-June-2016); see p. 9
Aleksandar Cvetkovic, Predrag Rajkovic and Milos Ivkovic, Catalan Numbers, the Hankel Transform and Fibonacci Numbers, Journal of Integer Sequences, Vol. 5 (2002), Article 02.1.3
Sergio Falcon, Catalan transform of the K-Fibonacci sequence, Commun. Korean Math. Soc. 28 (2013), No. 4, pp. 827-832; http://dx.doi.org/10.4134/CKMS.2013.28.4.827.
Guo-Niu Han, Enumeration of Standard Puzzles
Guo-Niu Han, Enumeration of Standard Puzzles [Cached copy]
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 431
Fumitaka Yura, Hankel Determinant Solution for Elliptic Sequence, arXiv:1411.6972 [nlin.SI], (25-November-2014); see p. 7
|
|
|
FORMULA
|
a(n) = C(n)+C(n+1) = ((5*n+4)*(2*n)!)/(n!*(n+2)!).
G.f. A(x) satisfies x^2*A(x)^2 + (x-1)*A(x) + (x+2) = 0. - Michael Somos, Sep 11 2003
G.f.: (1-x - (1+x)*sqrt(1-4*x)) / (2*x^2) = (4+2*x) / (1-x + (1+x)*sqrt(1-4*x)). a(n)*(n+2)*(5*n-1) = a(n-1)*2*(2*n-1)*(5*n+4), n>0. - Michael Somos, Sep 11 2003
a(n) ~ 5*Pi^(-1/2)*n^(-3/2)*2^(2*n)*{1 - 93/40*n^-1 + 625/128*n^-2 - 10227/1024*n^-3 + 661899/32768*n^-4 ...}. - Joe Keane (jgk(AT)jgk.org), Sep 13 2002
G.f.: c(x)*(1+c(x))= (-1 +(1+x)*c(x))/x with the g.f. c(x) of A000108 (Catalan).
a(n) = binomial(2*n,n)/(n+1)*hypergeom([-1,n+1/2],[n+2],-4). - Peter Luschny, Aug 15 2012
(n+2)*a(n) + (-3*n-2)*a(n-1) + 2*(-2*n+3)*a(n-2)=0. - R. J. Mathar, Dec 02 2012
0 = a(n)*(+16*a(n+1) + 38*a(n+2) - 18*a(n+3)) + a(n+1)*(-14*a(n+1) + 19*a(n+2) - 7*a(n+3)) + a(n+2)*(+a(n+2) + a(n+3)) for all n>=0. - Michael Somos, Jan 17 2015
0 = a(n)^2*(+368*a(n+1) - 182*a(n+2)) + a(n)*a(n+1)*(-306*a(n+1) + 317*a(n+2)) + a(n)*a(n+2)*(-77*a(n+2)) + a(n+1)^2*(-14*a(n+1) - 6*a(n+2)) + a(n+1)*a(n+2)*(+8*a(n+2)) for all n>=0. - Michael Somos, Jan 17 2015
E.g.f.: (BesselI(0,2*x) - (x - 1)*BesselI(1,2*x)/x)*exp(2*x). - Ilya Gutkovskiy, Jun 08 2016
|
|
|
EXAMPLE
|
G.f. = 2 + 3*x+ 7*x^2 + 19*x^3 + 56*x^4 + 174*x^5 + 561*x^6 + 1859*x^7 + ...
|
|
|
MATHEMATICA
|
a[n_]:=Binomial[2*n, n]*(5*n+4)/(n+1)/(n+2); (* Vladimir Joseph Stephan Orlovsky, Dec 13 2008 *)
a[ n_] := If[ n < 0, 0, CatalanNumber[n] + CatalanNumber[n + 1]]; (* Michael Somos, Jan 17 2015 *)
|
|
|
PROG
|
(PARI) {a(n) = if( n<0, 0, binomial(2*n, n) * (5*n+4) / ((n+1) * (n+2)))};
(Sage) [catalan_number(i)+catalan_number(i+1) for i in xrange(0, 25)] # Zerinvary Lajos, May 17 2009
(MAGMA) [((5*n+4)*Factorial(2*n))/(Factorial(n)*Factorial(n+2)): n in [0..30] ]; // Vincenzo Librandi, Aug 19 2011
(Python)
from __future__ import division
A005807_list, b = [], 2
for n in range(10**3):
A005807_list.append(b)
b = b*(4*n+2)*(5*n+9)//((n+3)*(5*n+4)) # Chai Wah Wu, Jan 28 2016
|
|
|
CROSSREFS
|
Cf. A000108.
Cf. A071716, A000778.
Sequence in context: A033844 A037028 A052919 * A167422 A060276 A025563
Adjacent sequences: A005804 A005805 A005806 * A005808 A005809 A005810
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
N. J. A. Sloane
|
|
|
EXTENSIONS
|
More terms from Joe Keane (jgk(AT)jgk.org), Feb 08 2000
Asymptotic series corrected and extended by Michael Somos, Sep 11 2003
|
|
|
STATUS
|
approved
|
| |
|
|
