|
%I #26 Mar 29 2021 13:43:26
%S 1,2,14,106,784,6040,47332,375196,3001966,24190148,196034522,
%T 1596030740,13044459766,106961525744,879512777006,7249483605580,
%U 59881171431050,495545064567260,4107666916668414,34099685718629264,283454909832384416,2359069189033880228
%N Number of possible basketball games that end in a tie (n:n). Equivalently, the number of walks on the square lattice from (0,0) to (n,n) where the allowed steps are {(1,0),(2,0),(3,0), (0,1),(0,2),(0,3)}.
%H Alois P. Heinz, <a href="/A122680/b122680.txt">Table of n, a(n) for n = 0..1000</a>
%H Moa Apagodu and Doron Zeilberger, <a href="http://www.math.rutgers.edu/~zeilberg/mamarim/mamarimhtml/appswz.html">FIVE Applications of Wilf-Zeilberger Theory to Enumeration and Probability</a>; <a href="/A036692/a036692.pdf">Local copy</a> [Pdf file only, no active links]
%H M. Apagodu and D. Zeilberger, <a href="http://www.math.rutgers.edu/~zeilberg/tokhniot/AppsWZmulti">Maple package to generate recurrence</a>; <a href="/A122680/a122680.txt">Local copy</a>
%H M. Apagodu and D. Zeilberger, <a href="http://www.math.rutgers.edu/~zeilberg/tokhniot/oAppsWZmulti4">6th order recurrence</a>; <a href="/A122680/a122680_1.txt">Local copy</a>
%e a(1) = 2 because the number of ways of getting the score to be (1,1) is
%e (0,0) -> (1,0) -> (1,1),
%e (0,0) -> (0,1) -> (1,1).
%p b:= proc(x, y) option remember; `if`(x<0 or y<0, 0,
%p `if`([x, y]=[0, 0], 1, add(b(x-i, y) +b(x, y-i), i=1..3)))
%p end:
%p a:= n-> b(n, n):
%p seq(a(n), n=0..30); # _Alois P. Heinz_, Jul 24 2011
%t b[x_, y_] := b[x, y] = If[x < 0 || y < 0, 0, If[{x, y} == {0, 0}, 1, Sum[b[x - i, y] + b[x, y - i], {i, 3}]]];
%t a[n_] := b[n, n];
%t a /@ Range[0, 30] (* _Jean-François Alcover_, May 13 2020, after _Alois P. Heinz_ *)
%K nonn,walk
%O 0,2
%A _Doron Zeilberger_, Oct 20 2006
|
