This site is supported by donations to The OEIS Foundation.



(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A003519 a(n) = 10*C(2n+1, n-4)/(n+6).
(Formerly M4721)

%I M4721

%S 1,10,65,350,1700,7752,33915,144210,600875,2466750,10015005,40320150,

%T 161280600,641886000,2544619500,10056336264,39645171810,155989499540,

%U 612815891050,2404551645100,9425842448792,36921502679600,144539291740025,565588532895750,2212449261033375

%N a(n) = 10*C(2n+1, n-4)/(n+6).

%C Number of standard tableaux of shape (n+5,n-4). - _Emeric Deutsch_, May 30 2004

%C a(n) = A214292(2*n,n-5) for n > 4. - _Reinhard Zumkeller_, Jul 12 2012

%C a(n) is the number of North-East paths from (0,0) to (n,n) that cross the diagonal y = x horizontally exactly twice. By symmetry, it is also the number of North-East paths from (0,0) to (n,n) that cross the diagonal y = x vertically exactly twice. Details can be found in Section 3.3 in Pan and Remmel's link. - _Ran Pan_, Feb 02 2016

%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

%H Robert Israel, <a href="/A003519/b003519.txt">Table of n, a(n) for n = 4..1650</a>

%H Daniel Birmajer, Juan B. Gil, Michael D. Weiner, <a href="https://arxiv.org/abs/1707.09918">Bounce statistics for rational lattice paths</a>, arXiv:1707.09918 [math.CO], 2017, p. 9.

%H R. K. Guy, <a href="/A005555/a005555.pdf">Letter to N. J. A. Sloane, May 1990</a>

%H R. K. Guy, <a href="http://www.cs.uwaterloo.ca/journals/JIS/VOL3/GUY/catwalks.html">Catwalks, sandsteps and Pascal pyramids</a>, J. Integer Sequences, Vol. 3 (2000), Article #00.1.6.

%H V. E. Hoggatt, Jr., <a href="/A005676/a005676.pdf">7-page typed letter to N. J. A. Sloane with suggestions for new sequences</a>, circa 1977.

%H V. E. Hoggatt, Jr. and M. Bicknell, <a href="http://www.fq.math.ca/Scanned/14-5/hoggatt1.pdf">Catalan and related sequences arising from inverses of Pascal's triangle matrices</a>, Fib. Quart., 14 (1976), 395-405.

%H Ran Pan, Jeffrey B. Remmel, <a href="http://arxiv.org/abs/1601.07988">Paired patterns in lattice paths</a>, arXiv:1601.07988 [math.CO], 2016.

%F G.f.: x^4*C(x)^10, where C(x)=[1-sqrt(1-4x)]/(2x) is g.f. for the Catalan numbers (A000108). - _Emeric Deutsch_, May 30 2004

%F Let A be the Toeplitz matrix of order n defined by: A[i,i-1]=-1, A[i,j]=Catalan(j-i), (i<=j), and A[i,j]=0, otherwise. Then, for n>=9, a(n-5)=(-1)^(n-9)*coeff(charpoly(A,x),x^9). [_Milan Janjic_, Jul 08 2010]

%F From _Robert Israel_, Feb 02 2016: (Start)

%F a(n+1) = 2*(n+1)*(2n+3)/((n+7)*(n-3)) * a(n).

%F a(n) ~ 20 * 4^n/sqrt(Pi*n^3). (End)

%F E.g.f.: 5*BesselI(5,2*x)*exp(2*x)/x. - _Ilya Gutkovskiy_, Jan 23 2017

%p seq(10*binomial(2*n+1,n-4)/(n+6), n=4..50); # _Robert Israel_, Feb 02 2016

%t Table[10 Binomial[2 n + 1, n - 4]/(n + 6), {n, 4, 28}] (* _Michael De Vlieger_, Feb 03 2016 *)

%o (PARI) a(n) = 10*binomial(2*n+1, n-4)/(n+6); \\ _Michel Marcus_, Feb 02 2016

%o (MAGMA) [10*Binomial(2*n+1, n-4)/(n+6): n in [4..35]]; // _Vincenzo Librandi_, Feb 03 2016

%Y A diagonal of any of the essentially equivalent arrays A009766, A030237, A033184, A059365, A099039, A106566, A130020, A047072.

%Y Cf. A000108, A000245, A002057, A000344, A003517, A000588, A003518, A001392.

%K nonn,easy

%O 4,2

%A _N. J. A. Sloane_

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

License Agreements, Terms of Use, Privacy Policy .

Last modified February 18 02:09 EST 2018. Contains 299297 sequences. (Running on oeis4.)