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.

A361587 Triangle read by rows: T(n,k) is the number of weakly connected digraphs on n unlabeled nodes with k strongly connected components.

Table of values

n a(n)
0 1
1 0
2 1
3 0
4 1
5 1
6 0
7 5
8 4
9 4
10 0
11 83
12 56
13 36
14 24
15 0
16 5048
17 2406
18 1101
19 542
20 267
21 0
22 1047008
23 324917
24 101307
25 37017
26 14947
27 5647
28 0
29 705422362
30 136882286
31 27757789
32 7134897
33 2257234
34 779257
35 237317
36 0
37 1580348371788
38 183851281949
39 23086772643
40 3922864504
41 907027520
42 258909828
43 78691767
44 20035307

List of values

[1, 0, 1, 0, 1, 1, 0, 5, 4, 4, 0, 83, 56, 36, 24, 0, 5048, 2406, 1101, 542, 267, 0, 1047008, 324917, 101307, 37017, 14947, 5647, 0, 705422362, 136882286, 27757789, 7134897, 2257234, 779257, 237317, 0, 1580348371788, 183851281949, 23086772643, 3922864504, 907027520, 258909828, 78691767, 20035307]

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

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