%I M3691 N1509 #28 Mar 10 2023 03:18:38
%S 4,60,550,4004,25480,148512,813960,4263600,21573816,106234700,
%T 511801290,2421810300,11289642000,51967090560,236635858800,
%U 1067518772640,4776759725400,21221827263000,93687293423724,411270420524040,1796296260955504,7809983743284800,33816739954270000
%N Number of partitions of an n-gon into (n-5) parts.
%C a(n) = V(r=n,k=n-5), 4th subdiagonal of the triangle of V on page 240.
%C It appears that V(r=15,k=10) in the Cayley table is an error, so the sequence was intended to be 4, 60, 550, 4004, 25480, 148512, 813960, 4263600, 21573816, 106234700, 511801290, 2421810300, 11289642000, 51967090560, 236635858800... - _R. J. Mathar_, Nov 26 2011
%D N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A. Cayley, <a href="http://dx.doi.org/10.1112/plms/s1-22.1.237">On the partitions of a polygon</a>, Proc. London Math. Soc., 22 (1891), 237-262 = Collected Mathematical Papers. Vols. 1-13, Cambridge Univ. Press, London, 1889-1897, Vol. 13, pp. 93ff.
%p V := proc(r,k)
%p local a ,t;
%p a := k-1;
%p for t from k-2 to 1 by -1 do
%p a := a*(r+t)/(t+2) ;
%p end do:
%p for t from 3 to k+1 do
%p a := a*(r-t)/(k-t+2) ;
%p end do:
%p a ;
%p end proc:
%p A002060 := proc(n)
%p V(n,n-5) ;
%p end proc:
%p seq(A002060(n),n=7..25) ; # _R. J. Mathar_, Nov 26 2011
%t V[r_, k_] := Module[{a, t}, a = k - 1;
%t For[t = k - 2, t >= 1, t--, a = a*(r + t)/(t + 2)];
%t For[t = 3, t <= k + 1, t++, a = a*(r - t)/(k - t + 2)];
%t a];
%t A002060[n_] := V[n, n - 5];
%t Table[A002060[n], {n, 7, 29}] (* _Jean-François Alcover_, Mar 10 2023, after _R. J. Mathar_ *)
%Y Cf. A002058, A002059.
%K nonn
%O 7,1
%A _N. J. A. Sloane_
%E More terms from _Hugo Pfoertner_, Dec 26 2021