cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A351869 a(n) is the number of self-complementary score sequences that are possible for strong tournaments on n vertices.

Table of values

n a(n)
0 1
1 1
2 0
3 1
4 1
5 3
6 3
7 9
8 11
9 30
10 39
11 103
12 141
13 363
14 514
15 1301
16 1894
17 4727
18 7036
19 17358
20 26311
21 64282
22 98936
23 239712
24 373806
25 899115
26 1418130
27 3389078
28 5399133
29 12828749
30 20619565
31 48739465
32 78963217
33 185769110
34 303128971
35 710067027
36 1166206802
37 2720959217
38 4495461790

List of values

[1, 1, 0, 1, 1, 3, 3, 9, 11, 30, 39, 103, 141, 363, 514, 1301, 1894, 4727, 7036, 17358, 26311, 64282, 98936, 239712, 373806, 899115, 1418130, 3389078, 5399133, 12828749, 20619565, 48739465, 78963217, 185769110, 303128971, 710067027, 1166206802, 2720959217, 4495461790]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.