This site is supported by donations to The OEIS Foundation.



(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A210726 a(2)=1, a(3)=2; thereafter a(n) = 2a(n-1)-a(n-2)+A046919(n). 2


%S 1,2,4,9,22,59,169,506,1577,5078,16729,56098,190981,658442,2294164,

%T 8066363,28588554,102036631,366458118,1323463507,4803734390,

%U 17515357533,64128879398,235682969485,869175349090,3215674910037,11932102898252,44396448313385,165608308422048,619217961493403,2320410595131693,8713343724905902,32782954997996347,123567462151713252,466559336920866937,1764469819249171154

%N a(2)=1, a(3)=2; thereafter a(n) = 2a(n-1)-a(n-2)+A046919(n).

%C According to Riordan (1968), this is the number of possible score sequences in a tournament with n nodes, but the latter is given by A000571, which is a different sequence.

%H J. Riordan, <a href="http://dx.doi.org/10.1016/S0021-9800(68)80032-8">The number of score sequences in tournaments</a>, J. Combin. Theory, 5 (1968), 87-89.

%Y Cf. A046919.

%K nonn

%O 2,2

%A _N. J. A. Sloane_, May 09 2012

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 14 16:48 EDT 2019. Contains 328022 sequences. (Running on oeis4.)