|
%I M2987 #34 Sep 08 2022 08:44:33
%S 1,3,15,45,189,588,2352,7560,29700,98010,382239,1288287,5010005,
%T 17177160,66745536,232092432,901995588,3173688180,12342120700,
%U 43861998180,170724392916,611947174608,2384209771200,8609646396000,33577620944400,122041737663300,476432168185575
%N Number of walks on square lattice.
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H Vincenzo Librandi, <a href="/A005560/b005560.txt">Table of n, a(n) for n = 2..1000</a>
%H R. K. Guy, <a href="/A005555/a005555.pdf">Letter to N. J. A. Sloane, May 1990</a>
%H R. K. Guy, <a href="https://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, w_n'(2).
%F a(n) = C(n+3, ceiling(n/2))*C(n+2, floor(n/2)) - C(n+3, ceiling((n-1)/2))*C(n+2, floor((n-1)/2)). - _Paul D. Hanna_, Apr 16 2004
%F Conjecture: (n-1)*(n-2)*(2*n+1)*(n+5)*(n+4)*a(n) -4*n*(n+1)*(2*n^2+4*n+19)*a(n-1) -16*n^2*(n-1)*(2*n+3)*(n+1)*a(n-2)=0. - _R. J. Mathar_, Apr 02 2017
%p wnprime := proc(n,y)
%p local k;
%p if type(n-y,'even') then
%p k := (n-y)/2 ;
%p binomial(n+1,k)*(binomial(n,k)-binomial(n,k-1)) ;
%p else
%p k := (n-y-1)/2 ;
%p binomial(n+1,k)*binomial(n,k+1)-binomial(n+1,k+1)*binomial(n,k-1) ;
%p end if;
%p end proc:
%p A005560 := proc(n)
%p wnprime(n,2) ;
%p end proc:
%p seq(A005560(n),n=2..20) ; # _R. J. Mathar_, Apr 02 2017
%t Table[Binomial[n+3, Ceiling[n/2]] Binomial[n+2, Floor[n/2]]-Binomial[n+3, Ceiling[(n-1)/2]] Binomial[n+2, Floor[(n-1)/2]], {n, 0, 30}] (* _Vincenzo Librandi_, Apr 03 2017 *)
%o (PARI) {a(n)=binomial(n+3,ceil(n/2))*binomial(n+2,floor(n/2)) - binomial(n+3,ceil((n-1)/2))*binomial(n+2,floor((n-1)/2))}
%o (Magma) [Binomial(n+3, Ceiling(n/2))*Binomial(n+2, Floor(n/2)) - Binomial(n+3, Ceiling((n-1)/2))*Binomial(n+2, Floor((n-1)/2)): n in [0..30]]; // _Vincenzo Librandi_, Apr 03 2017
%Y Cf. A005558-A005562, A093768.
%K nonn,walk
%O 2,2
%A _N. J. A. Sloane_
|
