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.

A350609 Triangle read by rows: T(n,k) (n >= 1, 1 <= k <= n) = number of subdigraphs of the transitive tournament on n nodes that have k weak components.

Table of values

n a(n)
1 1
2 1
3 1
4 4
5 2
6 2
7 31
8 15
9 10
10 8
11 474
12 228
13 162
14 96
15 64
16 14357
17 7057
18 5242
19 3296
20 1792
21 1024
22 865024
23 438662
24 342394
25 222720
26 130048
27 65536
28 32768
29 103931595
30 54542867
31 44669602
32 30110848
33 18337792
34 10027008
35 4718592
36 2097152
37 24935913222
38 13548525896
39 11608243634
40 8093078016
41 5130403840
42 2945449984
43 1518338048
44 671088640
45 268435456

List of values

[1, 1, 1, 4, 2, 2, 31, 15, 10, 8, 474, 228, 162, 96, 64, 14357, 7057, 5242, 3296, 1792, 1024, 865024, 438662, 342394, 222720, 130048, 65536, 32768, 103931595, 54542867, 44669602, 30110848, 18337792, 10027008, 4718592, 2097152, 24935913222, 13548525896, 11608243634, 8093078016, 5130403840, 2945449984, 1518338048, 671088640, 268435456]