|
%I #38 Mar 25 2020 11:14:17
%S 1,1,2,4,7,11,18,31,53,89,149,251,424,715,1204,2028,3418,5761,9708,
%T 16358,27565,46452,78279,131910,222285,374581,631222,1063696,1792472,
%U 3020560,5090059,8577449,14454177,24357268,41045336,69167021,116555915
%N Number of tournaments on n nodes determined by their score vectors.
%C a(n+1) is the number of multus bitstrings of length n with no runs of 5 ones. - _Steven Finch_, Mar 25 2020
%H T. D. Noe, <a href="/A000570/b000570.txt">Table of n, a(n) for n = 1..500</a>
%H Steven Finch, <a href="https://arxiv.org/abs/2003.09458">Cantor-solus and Cantor-multus distributions</a>, arXiv:2003.09458 [math.CO], 2020.
%H Prasad Tetali, <a href="https://doi.org/10.1006/jctb.1997.1799">A characterization of unique tournaments</a>, J. Comb Theory B 72 (1) (1998), 157-159.
%H <a href="/index/To#tournament">Index entries for sequences related to tournaments</a>
%H <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,1,1,1).
%F a(n) = a(n-5) + a(n-4) + a(n-3) + a(n-1). - _Jon E. Schoenfield_, Aug 07 2006
%F G.f.: (1+x^2+x^3+x^4)/(1-x-x^3-x^4-x^5). - _Harvey P. Dale_, May 05 2011
%p A000570 := proc(n) option remember; if n <= 2 then RETURN(1) elif n=3 then RETURN(2) elif n=4 then RETURN(4) elif n=5 then RETURN(7) else A000570(n-1)+A000570(n-3)+A000570(n-4)+A000570(n-5); fi; end;
%t LinearRecurrence[{1,0,1,1,1},{1,1,2,4,7},50] (* _Harvey P. Dale_, May 05 2011 *)
%o (PARI) a(n)=([0,1,0,0,0; 0,0,1,0,0; 0,0,0,1,0; 0,0,0,0,1; 1,1,1,0,1]^(n-1)*[1;1;2;4;7])[1,1] \\ _Charles R Greathouse IV_, Jun 15 2015
%K nonn,nice,easy
%O 1,3
%A Prasad Tetali [ tetali(AT)math.gatech.edu ]
%E More terms from _James A. Sellers_, Feb 06 2000
|
